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 int
#define pb push_back
#define M 1e9+7
int main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	int t = 1;
	// cin >> t;
	while(t--)
	{
		ll n, k;
		cin >> n >> k;
		if(k>=n){
			char c ='a';
			for(int i = 0; i < n; i++) {
				cout << c;
				c++;
			}
		}
		else{
			char c = 'a';
			string s;
		
			for(int i=0;i<k;i++)
				{
					for(int j=i;j<k;j++){
						s.push_back('a'+i);
					if(j!=i)
					s.push_back('a'+j);}
				}
				s.push_back('a');
for(int i=0;i<min(n,(ll)s.length());i++)
	cout<<s[i];
n-=s.length();
if(n>0)
{
	while(n>0){
for(int i=1;i<min(n+1,(ll)s.length());i++)
	cout<<s[i];
n=n-s.length()+1;
}
}
		}



		// cout << endl;
	}
	
	return 0;
}