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;
int ch[30][30],s[30];
signed main(){
    int n,k;
    cin>>n>>k;
    string ans="";int cur=1;
    for(int i=1;i<=k;++i) s[i]=k;
    for(int i=1;i<n;++i){
        int fl=0;
        for(int j=1;j<=k;++j)
            if(!ch[cur][j] && s[j]!=0){
                ch[cur][j]=1; s[cur]--;
                cur=j;
                ans+=char('a'+j-1);
                fl=1;
                break;
            }
        if(!fl){
            for(int j=1;j<=k;++j)
            if(!ch[cur][j]){
                ch[cur][j]=1;cur=j;fl=1;
                ans+=char('a'+j-1);
                break;
            }
            if(!fl) break;
        }
    }
    //cout<<ans<<endl;
    string sum="a";
    while(sum.size()<n) sum+=ans;
    for(int i=0;i<n;++i) cout<<sum[i];
    return 0;
}