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
n, k = map(int, input().split())
ans = 'a'
cycle = 1
tmp = ''
if k==1:
	print('a'*n)
elif k==2:
	tmp = 'aabba'
	if n<=5:
		print(tmp[:n])
	else:
		ans = tmp
		n -= 5
		while n>=4:
			ans += tmp[1:]
			n -= 4
		if n>0:
			ans += tmp[1:1+n]
		print(ans)
else:
	tmp = 'aabba'
	cnt = 3
	while cnt<=k:
		cnt2 = 2
		while cnt2<=cnt:
			tmp += chr(cnt-1+ord('a'))
			tmp += chr(cnt2-1+ord('a'))
			cnt2 += 1
		tmp += 'a'
		cnt += 1
	if n<=len(tmp):
		print(tmp[:n])
	else:
		ans = tmp
		n -= len(tmp)
		while n>=len(tmp)-1:
			ans += tmp[1:]
			n -= len(tmp)-1
		if n>0:
			ans += tmp[1:1+n]
		print(ans)


