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 endl '\n'
#define int long long 
#define __ ios_base::sync_with_stdio(false);cin.tie(NULL);

signed main(){__
	int t= 1,n,k;
    while(t--){
        cin>>n>>k;
        string ans(n,'?');
        vector<char> last(26,'a');
        ans[0] ='a';
        char limit = char(k+'a');
        int sz =0;
        for(int i = 1;i<n;i++){
            if(last[last[ans[i-1]-'a']-'a']==limit){
                last[ans[i-1]-'a']++;
            }
            if(last[ans[i-1]-'a']==limit)break;
            ans[i] = last[ans[i-1]-'a'];
            sz++;
            last[ans[i-1]-'a']++;
        }
        sz++;
        for(int i = 0;i<n;i++){
            cout<<ans[i%sz];
        }
        cout<<endl;
    }
    return 0;
}