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 sys


def putin():
    return map(int, sys.stdin.readline().split())


def sol():
    n, k = putin()
    n -= 1
    G = {}
    for i in range(k):
        G[i] = list(range(k))
    cur = 0
    cycle = ''
    while True:
        try:
            # print(cur, cur + G[cur][0])
            cycle += chr(ord('a') + (cur + G[cur][0]) % k)
            add = G[cur][0]
            G[cur].pop(0)
            cur += add
            cur %= k
        except Exception:
            break
    print('a', end='')
    for i in range(n):
        print(cycle[i % len(cycle)], end='')


sol()
