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
import sys
ints = (int(x) for x in sys.stdin.read().split())
sys.setrecursionlimit(3000)

def magic(N=26):
    ans = [None]*(N+1)
    ans[1] = [(0,0)]
    for k in range(2, N+1):
        f = [(0,k-1), (k-1,k-1), (k-1,0)]
        for i,j in ans[k-1]:
            if i==j!=0:
                f.append((i, k-1))
                f.append((k-1, j))
            f.append((i,j))
        ans[k] = f
    return ans

def main():
    n, k = (next(ints) for i in range(2))
    f = [i for i,j in magic(k)[k]]
    #print(f)
    f = ''.join(chr(97+f[i]) for i in range(len(f)))
    ans = (f * (1+(n//len(f))))[:n]
    assert len(ans)==n
    print(ans)
    return

main()
