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:
def split(word):
   return [char for char in word] 
n,k=map(int,input().split())
a=[[] for j in range(26)]
a[0]='a'
a[1]='abb'
a[2]='acbcc'
a[3]='adbdcdd'
a[4]='aebecedee'
a[5]='afbfcfdfeff'
a[6]='agbgcgdgegfgg'
a[7]='ahbhchdhehfhghh'
a[8]='aibicidieifigihii'
a[9]='ajbjcjdjejfjgjhjijj'
a[10]='akbkckdkekfkgkhkikjkk'
a[11]='alblcldlelflglhliljlkll'
a[12]='ambmcmdmemfmgmhmimjmkmlmm'
a[13]='anbncndnenfngnhninjnknlnmnn'
a[14]='aobocodoeofogohoiojokolomonoo'
a[15]='apbpcpdpepfpgphpipjpkplpmpnpopp'
a[16]='aqbqcqdqeqfqgqhqiqjqkqlqmqnqoqpqq'
a[17]='arbrcrdrerfrgrhrirjrkrlrmrnrorprqrr'
a[18]='asbscsdsesfsgshsisjskslsmsnsospsqsrss'
a[19]='atbtctdtetftgthtitjtktltmtntotptqtrtstt'
a[20]='aubucudueufuguhuiujukulumunuoupuqurusutuu'
a[21]='avbvcvdvevfvgvhvivjvkvlvmvnvovpvqvrvsvtvuvv'
a[22]='awbwcwdwewfwgwhwiwjwkwlwmwnwowpwqwrwswtwuwvww'
a[23]='axbxcxdxexfxgxhxixjxkxlxmxnxoxpxqxrxsxtxuxvxwxx'
a[24]='aybycydyeyfygyhyiyjykylymynyoypyqyrysytyuyvywyxyy'
a[25]='azbzczdzezfzgzhzizjzkzlzmznzozpzqzrzsztzuzvzwzxzyzz'
s=''
for j in range(k):
   s=s+a[j]
g=[]   
s=split(s)
l=len(s)
for j in range(n):
   g.append(s[j%l])
print(''.join(map(str,g)))