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 string
n, k = list(map(int, input().split()))
s = ''
if k == 1:
    s = 'a' * n
else:
    lens = 0
    first = 0
    second = 0
    alphabet = list(string.ascii_lowercase)[:k]
    while lens < n:
        if lens != 0 and first == second == 0:
            repeats = n // lens
            tail = n - repeats * lens
            tails = s[:tail]
            s = s * repeats
            s += tails
            lens = n
        elif second == first:
            s += alphabet[first]
            lens += 1
            if second < k-1:
                second += 1
            else:
                first = 0
                second = 0
        elif second < k:
            s += alphabet[first]
            lens += 1
            if lens != n:
                s += alphabet[second]
                lens += 1
            second += 1
        else:
            if first < k - 1:
                first += 1
            second = first
print(s)
