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

input = sys.stdin.readline
output = sys.stdout.write


def inp():
    return(int(input()))


def inlt():
    return(list(map(int, input().split())))


def insr():
    s = input()
    return(list(s[:len(s) - 1]))


def invr():
    return(map(int, input().split()))


def euler_path(i, adj, path):
    while len(adj[i]) > 0:
        j = adj[i].pop()
        euler_path(j, adj, path)
    path.appendleft(i)


def char(i):
    return chr(ord('a') + i)


[n, k] = inlt()
adj = [deque(range(0, k)) for _ in range(0, k)]
path = deque()

euler_path(0, adj, path)

snake_h = char(path.popleft())
snake = [char(i) for i in path]

output(snake_h)
n = n - 1

repeat = n // len(snake)
remain = n % len(snake)

snake_str = "".join(snake)
for i in range(0, repeat):
    output(snake_str)

c = 0
for i in snake:
    if c < remain:
        output(i)
        c = c + 1
    else:
        break