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 int
#define scan(any)       for(auto &i:any) cin>>i;
#define print(any)      for(auto i:any) cout<<i<<" "; 
#define endl            '\n'
#define pb              push_back
#define vll             vector<ll> 
#define f(i,x,y)        for(i=x;i<y;i++)
#define INF             LLONG_MAX
#define s(x)            sort(x.begin(),x.end())
#define all(v)          v.begin(),v.end()
#define p2(n,x)         cout << fixed << setprecision(x) <<n<<endl; 
#define pll             pair<ll,ll> 
#define mll             map<ll,ll>
#define ff              first
#define ss              second
#define blt(x)          __builtin_popcount(x)
#define pi              2*asin(1.0)

void solve()
{
    ll i,j,k,n;
    cin>>n>>k;
    if(k==1)
    {
        f(i,0,n)
        cout<<'a';
        return ;
    }
    string a1;
    f(i,0,k)
    {
        a1.pb('a'+i);
        f(j,i+1,k)
        {
            a1.pb('a'+i);
            a1.pb('a'+j);
        }
    }
    string a2=a1;
    //cout<<a1<<endl<<a2<<endl;

    ll i1=0,i2=0;
    ll turn =0;
    f(i,0,n)
    {
        if(!turn)
        {
            if(i1==a1.size())
            {
                i1=0;
                turn =1;
                cout<<a2[i2];
                i2++;
            }
            else
            {
                cout<<a1[i1];
                i1++;
            }
        }
        else
        {
            if(i2==a2.size())
            {
                i2=0;
                turn =0;
                cout<<a1[i1];
                i1++;
            }
            else
            {
                cout<<a2[i2];
                i2++;
            }
        }
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("E:/Programming/input.txt", "r", stdin);
        freopen("E:/Programming/output.txt", "w", stdout);
    #endif

    ios::sync_with_stdio(0);
    cin.tie(0);
    
    ll t = 1;
    while(t--) {
        solve();    
    }
    return 0;
}