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 sys
from collections import deque
i2a = {i:chr(97+i) for i in range(26)}
a2i = {chr(97+i):i for i in range(26)}
n, k = map(int, sys.stdin.readline().split())

list_a = [deque([i2a[(i+j)%k] for j in range(k)]) for i in range(26)]
list_res = ['a']

for i in range(1, n):
    #print(a2i[list_res[-1]])
    key = list_a[a2i[list_res[-1]]].popleft()
    list_a[a2i[list_res[-1]]].append(key)
    list_res.append(key)
print("".join(list_res))