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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod=1000000007;
ll const md=998244353;
ll mypowr(ll a,ll b) {ll res=1;if(b<0)b=0;a%=mod; assert(b>=0);
for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll mypow(ll a,ll b) {ll res=1;if(b<0)b=0;assert(b>=0);
for(;b;b>>=1){if(b&1)res=res*a;a=a*a;}return res;}
ifstream in("input.txt");
ofstream out("output.txt");
#define mp make_pair
#define pb push_back
#define pf push_front
#define fi first
#define se second

//#define cin in
//#define cout out



int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cout<<fixed<<setprecision(15);

    ll n,k,nr=1;
    cin>>n>>k;
    if(k==1){
        for(int i=1;i<=n;++i){
            cout<<"a";
        }
        return 0;
    }
    string s="#aabb";
    for(int i=3;i<=k;++i){
        s+="a";
        char c=char('a'+i-1);
        s+=c;
        s+=c;
    }
    for(int i=2;i<k;++i){
        for(int j=i+1;j<=k;++j){
            char a1=char('a'+i-1);
            char b1=char('a'+j-1);
            s+=a1;s+=b1;
        }
    }
    int p=s.size()-1;
    for(int i=1;i<=n;++i){
        int u=i%p;if(u==0)u=p;
        cout<<s[u];
    }



    return 0;
}

