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;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;

int n, k;
char s[300005];

void solve() {
    while (~scanf("%d%d", &n, &k)) {
        memset(s, 0, sizeof(s));
        s[n + 1] = '\0';
        int top = 0;
        s[++top] = 'a';
        for (int i = 1; i <= k; ++i) {
            char cur = 'a' + i - 1;
            s[++top] = cur;
            for (int j = k; j >= i + 1; --j) {
                char tcur = 'a' + j - 1;
                s[++top] = tcur;
                if (j != i + 1)
                    s[++top] = cur;
            }
        }
        for (int i = k - 1; i >= 1; --i) {
            char cur = 'a' + i - 1;
            s[++top] = cur;
        }
//        puts(s + 1);
        int len = top;
        int sumlen = len;
        while (top <= n) {
            for (int i = 2; i <= len; ++i)
                s[++top] = s[i];
        }
        s[n + 1] = '\0';
        puts(s + 1);
    }
}

int main() {
    int T = 1;
//    scanf("%d", &T);
    for (int i = 1; i <= T; ++i) {
//        printf("Case #%d: ", i);
        solve();
    }
}