Let's define the cost of a string s as the number of index pairs i and j (1 ≤ i < j < |s|) such that s_i = s_j and s_{i+1} = s_{j+1}.

You are given two positive integers n and k. Among all strings with length n that contain only the first k characters of the Latin alphabet, find a string with minimum possible cost. If there are multiple such strings with minimum cost — find any of them.

Input

The only line contains two integers n and k (1 ≤ n ≤ 2 ⋅ 10^5; 1 ≤ k ≤ 26).

Output

Print the string s such that it consists of n characters, each its character is one of the k first Latin letters, and it has the minimum possible cost among all these strings. If there are multiple such strings — print any of them.

Examples

Input


9 4


Output


aabacadbb


Input


5 1


Output


aaaaa

Input


10 26


Output


codeforces
n,k=[int(i) for i in input().split()]
ans=""
for x in range(k):
    
    ans+=chr(x+97)*2

    for i in range(k):
        for j in range(k):
            tmp = chr(i+97)+chr(j+97)
            #print(tmp)
            if(ans.find(tmp)==-1):
                if(len(ans)>0):
                    #print(ans[-1]+tmp[0])
                    if(ans.find(ans[-1]+tmp[0])==-1):
                        ans+=tmp
    ans=ans[:len(ans)-1]
if(len(ans)>n):
    ans = ans[:n]
elif(len(ans)<n):
    while(len(ans)<n):
        tmp = str(ans)
        tmp[::-1]
        ans+=tmp
        if(len(ans)>n):
            break
    if(len(ans)>n):
        ans = ans[:n]
print(ans)