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>
#define N 100009
typedef long long ll;
using namespace std;

int main() {
	int t=1;
	//cin>>t;
	while(t--){
        int i,n,j,x,k;
        cin>>n>>k;
        string s="",ans="";
        char c1,c2;
        for(i=0;i<k-1;i++){
            c1='a'+i;
            s.push_back(c1);
            s.push_back(c1);
            for(j=i+2;j<k;j++){
                c2='a'+j;
                s.push_back(c2);
                s.push_back(c1);
            }
        }
        c1='a'+k-1;
        s.push_back(c1);
        for(i=k-1;i>-1;i--){
            c1='a'+i;
            s.push_back(c1);
        }
       //cout<<s<<endl;
       if(s.size()==1) {
            for(i=0;i<n;i++) ans+=s[0];
            cout<<ans<<endl;
            return 0 ;
       }
        j=0;
        for(i=0;i<n;i++,j++){
            if(j==s.size()) j=1;
            ans+=s[j];
        }
        cout<<ans;
	}
	return 0;
}