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=map(int,input().split())
arr=[set(list(range(k))) for i in range(k)]
ans=[0]
val='a'
for i in range(1,min(n,k**2)):
    x=arr[ans[i-1]].pop()
    ans.append(x)
    val+=chr(97+x)
    if len(arr[ans[i-1]])==0:
        for j in range(len(arr)):
            arr[j].discard(ans[i-1])
    
    '''if temp==0:
        arr=[set(list(range(k))) for i in range(k)]'''
    #print(x)
    #print('step1:',i,arr)
    #print(ans)
'''val=''
for i in range(n):
    val+=chr(97+ans[i])'''
val+='a'
rep=val[1:]
ans=val+rep*(1+(n-1)//(k**2))
ans=ans[:n]
print(ans)

    