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       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
#define         fastio               ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define      GR(a,n,m)               vector<vector<int>> a(n, vector<int>(m, 0));
 
void solve()
{
	int n, k;
	cin >> n >> k;

	map<pair<char, char>, int> m;
	string s = "";
	s += 'a';
	for(int i = 1;i < n;i++)
	{
		char c = char('a' + (k-1));
		int mn = m[{s.back(), c}];
		for(char x = char('a' + (k-1)); x >= 'a';x--)
		{
			if(m[{s.back(),x}] < mn)
			{
				c = x;
				mn = m[{s.back(), x}];
			}
		}
		m[{s.back(), c}]++;
		s+=c;
	}
	cout << s << '\n';
}
 
int32_t main()
{
	fastio;
    int t = 1;
   	//cin >> t;
   	while(t--)
   	{
   		solve();
   	}
}