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 nline "\n"
const ll N=2e5+4; 
const ll M=1e9+7;
void solve(){
    ll n,k; cin>>n>>k;
    vector<char> ans;   
    while(ans.size()<n){    
        for(ll i=0;i<k;i++){  
            ans.push_back(i+'a'); 
            for(ll j=i+1;j<k;j++){ 
                ans.push_back(i+'a');
                ans.push_back(j+'a');  
            }
        }  
    }  
    for(ll i=0;i<n;i++)     
        cout<<ans[i];
    return;

}
int main()         
{      
    ios_base::sync_with_stdio(false);            
    cin.tie(NULL);                      
    #ifndef ONLINE_JUDGE                   
    freopen("input.txt", "r", stdin);                                       
    freopen("output.txt", "w", stdout);                    
    #endif   
    ll t=1,ans=0; 
    //cin>>t;
    while(t--){
        solve();
    }
    cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";                   
}