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:
from collections import defaultdict


def fun(s):
    n = len(s)
    cost = 0
    for i in range(n-1):
        for j in range(i+1, n-1):
            if(s[i]+s[i+1] == s[j] + s[j+1]):
                cost += 1
    return cost


n, k = map(int, input().split())
all = "abcdefghijklmnopqrstuvwxyz"
s = ''
for i in range(k):
    s += all[i]
    for j in range(i+1, k):
        s += all[i]+all[j]
while(len(s)<n):
    s += s
print(s[:n])
# print(fun(s[:n]))