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>
#define ll long long int
#define f first
#define s second
#define pb(x) push_back(x)
#define inf (int)1e9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007

using namespace std;

void input() {

	ll n,k;
	cin>>n>>k;

	string s1,s;

	for(int i=0;i<k;i++) {

		for(int j=i;j<k-1;j++) {
			s1 += 'a'+j;
			s1 += 'a'+i;
		}

		s1 += 'a'+k-1;
	}

	// cout<<s1<<"\n";

	ll p = n/(k*k) + 1;

	for(int i=0;i<p;i++) {
		s += s1;
	}

	for(int i=0;i<n;i++) {
		cout<<s[i];
	}
	cout<<"\n";
    
}

int main(){

    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    input();

    return 0;
}