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
from sys import stdin,stdout
input = stdin.readline
from string import ascii_lowercase
#import string
#string.ascii_lowercase
def main():
    #t = int(input())
    t=1
    for z in range(t):
        #n = int(input())
        n, k  = map(int,input().split())
        #ai = list(map(int,input().split()))
        alph = ascii_lowercase
        ans = [""]*(k*(k+1))
        num = 0
        for i in range(k):
            for j in range(i,k):
                ans[num+1] = alph[i]
                ans[num] = alph[j]
                num += 2
            num -= 1
        ans = "".join(ans)[:-1]
        n2 = len(ans)
        while n > 0:
            if n > n2:
                n -= n2
                print(ans,end="")
            else:
                print(ans[:n])
                break
main()
