Problem: 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

Solution (in PYTHON3):

Solution:
import string
n,k = [int(i) for i in input().split()]
a = list(string.ascii_lowercase)
pr = 0
j1= 0 
for j in range(n):
    if pr ==n:
        break    
    #pr+=1
    if j1==k:
        j1 = 0
    print(a[j1],end="")
    pr+=1
    if pr ==n:
        break        
    for i in range(j1,k):
        if i != j1:
            print(a[j1],end="")
            pr+=1
            if pr == n:
                break
            print(a[i],end="")    
            pr+=1
            if pr == n:
                break
    j1+=1