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 random
import sys


def input():
    return sys.stdin.readline().rstrip()


def slv(n, k):
    #a = [1,5,1,4,1,3,1,2,5,2,4,2,3,5,3,4,5,5,4,4,3,3,2,2,1,1]

    def construct(K):
        if K == 1:
            return [1, 1]
        else:
            tmp = [1, K]
            for j in range(K - 1, 1, -1):
                tmp.append(K)
                tmp.append(j)
            tmp.append(K)
            return tmp + construct(K - 1)
    tmpans = construct(k)[:-1] * (n//(k * k) + 10)
    assert all(v <= k for v in tmpans)
    ans = list(map(lambda x: chr(x + ord('a') - 1), tmpans))[:n]
    print("".join(ans))
    return


def main():
    n, k = map(int, input().split())
    slv(n, k)
    return


if __name__ == "__main__":
    main()
