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
from os import path
import sys,time
# mod = int(1e9 + 7)
# import re
from math import ceil, floor,gcd,log,log2 ,factorial
from collections import defaultdict ,Counter , OrderedDict , deque
# from bisect import *
from functools import reduce ;from operator import mul 
maxx = float('inf');localsys = 0
if (path.exists('input.txt')):
	localsys = 1;start_time = time.time();sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
#left shift --- num*(2**k) --(k - shift)
input = sys.stdin.readline
n , k = map(int , input().split())
ans =''
for i in range(k):
	x = chr(i+97); ans+=x
	for j in range(i+1 , k):
		ans+= x + chr(j+97)
while len(ans) < n: ans*=2
print(ans[:n])






















if localsys:print("\n\nTime Elased :",time.time() - start_time,"seconds")