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 mod 1000000007
#define ll long long
int cnt[30];
char ans[300030];
int main()
{
    int n, k;
    scanf("%d%d", &n, &k);
    int num = k * (k - 1);
    int c = 1;
    while (c <= n)
    {   
        for (int i = 1; i <= k; i++)
        {
            for(int j=c+1;j<=c+(k-i)*2;j+=2)
            {
                ans[j]=i+'a'-1;
            }
            int now=i;
            for(int j=c;j<=c+(k-i)*2;j+=2)
            {
                ans[j]=now+'a'-1;
                now++;
            } 
            c+=(k-i)*2+1;
            //printf("%d\n",c);
        }
       
    }
    for(int i=1;i<=n;i++)printf("%c",ans[i]);printf("\n");
    //system("pause");
}