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 int long long
#define endl "\n"

constexpr int MOD = 1e9+7;

void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> c(26);
    vector<int> p;
    
    function<void(int)> dfs = [&](int v) {
        while (c[v] < k) {
            int u = c[v]++;
            dfs(u);
            p.push_back(u);
        }
    };

    dfs(0);
    cout << 'a';
    for (int i = 0; i < n-1; ++i)
        cout << ((char)(p[i%p.size()]+'a'));
    cout << endl;
}


int32_t main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr);

    solve();
    // int t; cin >> t;
    // while (t--) {
    //     solve();
    // }

    return 0;
}