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
def main():
    n, k = map(int, input().split());
    chars = 'abcdefghijklmnopqrstuvwxyz';
    ans = "";
    i = 0;
    counter = 0;
    while (i < (k-1)) and (counter < n):
        j = i;
        while (j < k) and (counter < n):
            if j == i:
                ans = ans + chars[i];
                counter += 1;
                j += 1;
                continue;
            ans = ans + chars[i] + chars[j];
            j += 1;
            counter += 2;
        i+=1;
    ans = ans + chars[i] + chars[0];
    counter += 2;
    ans = ans[:n];
    con = ans;
    if n > counter:
        m = int(n / counter);
        p = n % counter;
        for m_i in range(m-1):
            ans += con[1:];
            p += 1;
        ans += ans[1:p+1];
    print(ans)

if __name__ == '__main__':
    main();