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 CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll


string ans;
signed main()
{
	int t = 1;
	//cin >> t;
	while (t--)
	{
		ans.clear();
		int n, k;
		cin >> n >> k;
		ans += 'a';
		ans += 'a';
		for (int i = 1; i <= k; i++)
		{
			for (int j = i+2; j <= k; j++)
			{
				if (i == 1)
				{
					ans += 'a' + j - 1;
					ans += 'a' + j - 1;
					ans += 'a';
				}
				else
				{
					ans += 'a' + j - 1;
					ans += 'a' + i - 1;
				}
			}
			if (i != k)
			{
				if (i == 1)
				{
					ans += 'a' + i;
				}
				ans += 'a' + i;
			}
		}
		for (int i = k - 1; i >= 1; i--)ans += 'a' + i - 1;
		
		string tmp;
		for (int i = 1; i < ans.length(); i++)
			tmp += ans[i];
		
		if (n <= ans.size())
		{
			for (int i = 0; i < n; i++)
				cout << ans[i];
		}
		else
		{
			cout << ans;
			n -= ans.size();
			for (int i = 0; i < n/tmp.size(); i++)
				cout << tmp;
			for (int i = 0; i < n % tmp.size(); i++)
				cout << tmp[i];
		}
	}
}