//Classic
//g++ -std=c++17 -O2 -Wall a.cpp -o test
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define For(i,a,b) for(ll i=a;i<b;i++)
#define endl "\n"
#define debug2(x,y) cout<<"This side ----> "<<#x<<" -> "<<x<<" | "<<#y<<" -> "<<y<<endl;
#define debug(x) cout<<"This side    ----> "<<#x<<" -> "<<x<<endl
//#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
//#define ao(a, n) {for (int ele = 0; ele < (n); ele++) {cout << a[ele]<<" "; } cout << '\n';}
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
#define mint map<int,int>
#define mall map<ll,ll>
#define ciN cin
#define g(a,s) get<a>(s)
#define tin tuple<ll,ll,ll>
#define ter(x,y,z) ((x)?y:z)
bool isGoogles = 0;
const ll maxn = 2e5 + 10;
const ll max_val = 2e5 + 10;
const ll mod = 998244353;
const ll bits = 10;
ll caseNumber = 1;
////////////////////////////////////////////////////////////////

void jabru() {
	ll n, k; cin >> n >> k;
	int curr = 0;
	string s = "";
	int done = 0;
	while (done < n) {
		s += curr + 'a';
		done++;
		for (int i = curr + 1; i < k; i++) {
			if (done == n)break;
			if (done == n - 1) {
				s += curr + 'a'; done++;
			}
			else {
				s += curr + 'a'; s += i + 'a'; done += 2;
			}
		}
		curr++;
		curr %= k;
	}
	cout << s << endl;

}
bool TestCase = 0;


//////////////////////////////////////////////////////////////////




int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll t;
	t = 1;
	if (TestCase) {
		cin >> t;
	}
	while (t--) {
		if (isGoogles) {cout << "Case #" << caseNumber << ": ";} caseNumber++;
		jabru();
	}
	return 0;
}
### Prompt

Your task is to create a Cpp solution to the following 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

### Response

```cpp
//Classic
//g++ -std=c++17 -O2 -Wall a.cpp -o test
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define For(i,a,b) for(ll i=a;i<b;i++)
#define endl "\n"
#define debug2(x,y) cout<<"This side ----> "<<#x<<" -> "<<x<<" | "<<#y<<" -> "<<y<<endl;
#define debug(x) cout<<"This side    ----> "<<#x<<" -> "<<x<<endl
//#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
//#define ao(a, n) {for (int ele = 0; ele < (n); ele++) {cout << a[ele]<<" "; } cout << '\n';}
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
#define mint map<int,int>
#define mall map<ll,ll>
#define ciN cin
#define g(a,s) get<a>(s)
#define tin tuple<ll,ll,ll>
#define ter(x,y,z) ((x)?y:z)
bool isGoogles = 0;
const ll maxn = 2e5 + 10;
const ll max_val = 2e5 + 10;
const ll mod = 998244353;
const ll bits = 10;
ll caseNumber = 1;
////////////////////////////////////////////////////////////////

void jabru() {
	ll n, k; cin >> n >> k;
	int curr = 0;
	string s = "";
	int done = 0;
	while (done < n) {
		s += curr + 'a';
		done++;
		for (int i = curr + 1; i < k; i++) {
			if (done == n)break;
			if (done == n - 1) {
				s += curr + 'a'; done++;
			}
			else {
				s += curr + 'a'; s += i + 'a'; done += 2;
			}
		}
		curr++;
		curr %= k;
	}
	cout << s << endl;

}
bool TestCase = 0;


//////////////////////////////////////////////////////////////////




int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll t;
	t = 1;
	if (TestCase) {
		cin >> t;
	}
	while (t--) {
		if (isGoogles) {cout << "Case #" << caseNumber << ": ";} caseNumber++;
		jabru();
	}
	return 0;
}
```