Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. 

Innokentiy decides that new password should satisfy the following conditions:
 -  the length of the password must be equal to *n*, -  the password should consist only of lowercase Latin letters, -  the number of distinct symbols in the password must be equal to *k*, -  any two consecutive symbols in the password must be distinct. 
Your task is to help Innokentiy and to invent a new password which will satisfy all given conditions.
The first line contains two positive integers *n* and *k* (2 ≤ *n* ≤ 100, 2 ≤ *k* ≤ *min*(*n*, 26)) — the length of the password and the number of distinct symbols in it. 

Pay attention that a desired new password always exists.
In the first test there is one of the appropriate new passwords — java, because its length is equal to 4 and 3 distinct lowercase letters a, j and v are used in it.

In the second test there is one of the appropriate new passwords — python, because its length is equal to 6 and it consists of 6 distinct lowercase letters.

In the third test there is one of the appropriate new passwords — phphp, because its length is equal to 5 and 2 distinct lowercase letters p and h are used in it.

Pay attention the condition that no two identical symbols are consecutive is correct for all appropriate passwords in tests.
4 3
abca
6 6
abcdef
5 2
ababa
3 2
aba
10 2
ababababab
26 13
abcdefghijklmabcdefghijklm
100 2
abababababababababababababababababababababababababababababababababababababababababababababababababab
100 10
abcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghij
3 3
abc
6 3
abcabc
10 3
abcabcabca
50 3
abcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcab
90 2
ababababababababababababababababababababababababababababababababababababababababababababab
6 2
ababab
99 3
abcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabc
4 2
abab
100 3
abcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabca
40 22
abcdefghijklmnopqrstuvabcdefghijklmnopqr
13 8
abcdefghabcde
16 15
abcdefghijklmnoa
17 17
abcdefghijklmnopq
19 4
abcdabcdabcdabcdabc
100 26
abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuv
100 25
abcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxy
26 26
abcdefghijklmnopqrstuvwxyz
27 26
abcdefghijklmnopqrstuvwxyza
2 2
ab
26 25
abcdefghijklmnopqrstuvwxya
99 2
abababababababababababababababababababababababababababababababababababababababababababababababababa
99 26
abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstu
4 4
abcd
5 3
abcab
5 4
abcda
5 5
abcde
24 22
abcdefghijklmnopqrstuvab
26 14
abcdefghijklmnabcdefghijkl
26 15
abcdefghijklmnoabcdefghijk
30 12
abcdefghijklabcdefghijklabcdef
35 4
abcdabcdabcdabcdabcdabcdabcdabcdabc
79 3
abcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabca
79 14
abcdefghijklmnabcdefghijklmnabcdefghijklmnabcdefghijklmnabcdefghijklmnabcdefghi
85 13
abcdefghijklmabcdefghijklmabcdefghijklmabcdefghijklmabcdefghijklmabcdefghijklmabcdefg
90 25
abcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxyabcdefghijklmno
90 19
abcdefghijklmnopqrsabcdefghijklmnopqrsabcdefghijklmnopqrsabcdefghijklmnopqrsabcdefghijklmn
26 24
abcdefghijklmnopqrstuvwxab
100 17
abcdefghijklmnopqabcdefghijklmnopqabcdefghijklmnopqabcdefghijklmnopqabcdefghijklmnopqabcdefghijklmno
26 2
ababababababababababababab
import  random


n = int(input())
k = int(input())
#lst = list(map(int, input().split()))

str = ""
flag = True

for i in range(n):
    alpha = random.randrange(ord('a'),ord('z'))

    print(chr(alpha), i)
    flag = True
    while flag == True:

      if str.count(chr(alpha)) > k or (i != 0 and str[i-1] == chr(alpha)):
        continue
      else:
        str = str + chr(alpha)
        flag = False

print(str)