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 mod 1000000007
#define mod2 998244353
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define all(x) x.begin(), x.end()
#define speed ios_base::sync_with_stdio(false) \
    ;cin.tie(NULL) \
    ;cout.tie(NULL)
#define in(a) \
    for(auto &i:a) \
        cin>>i;
#define prnt(a) \
    for(auto i:a) \
        cout<<i<<" "; \
    cout<<endl;

ll power(ll x, ll y, ll m){
    if(y==0)
        return 1;
    ll p=power(x,y/2,m);
    p=(p*p)%m;
    return (y%2)?(p*x)%m:p;
}

ll modInverse(ll x, ll m){
    return power(x,m-2,m);
}

void solve(){
    ll n,k;
    cin>>n>>k;
    string s="";
    for(ll i=0;i<k;i++){
        s+=('a'+i);
        for(ll j=i+1;j<k;j++){
            s+=('a'+i);
            s+=('a'+j);
        }
    }
    string tmp=s;
    while(s.length()<n){
        s+=tmp;
    }
    cout<<s.substr(0,n)<<endl;
}

int main(){
    speed;
    ll t;
//    cin>>t;
    t=1;
    while(t--){
        solve();
    }
}