Prangon is a legendary programmer. But he has a weakness and it is string. To develop him in string sometimes he thinks about problems related to string.

One day he think what will be the lexicographically smallest string of length n in which you can only use lowercase English letters and can’t use more than m same letters. Can you do it for him?

Input

Input consist of two integers n and m.

Output

Output the expected string in one line. Don't forget to print end line after your output.

Constraints

1 <= n <= 10⁵

1 <= m <= 10⁵

m×26 >= n

For better understanding see the sample input output

Example

Input:
5 1

Output:
abcde