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;
int ha[100][100];
vector<pair<int,int> >seq;
int main()
{
	int t,p;
    scanf("%d%d",&t,&p);
    if(p==1)
    {
        for(int i = 0;i < t;i++)
        printf("%c",'a');
    }
    else
    {
        ha[0][0]=1;
        for(int i = 0;i < p-1;i++)
        {
            seq.push_back({i,i});
            for(int j = i+1;j < p-1;j++)
            {
                seq.push_back({i,j});
                seq.push_back({j,i});
                // printf("j");
            }
            seq.push_back({i,p-1});
            seq.push_back({p-1,i+1});
        }
        seq.push_back({p-1,0});
        for(int i = 0;i < t;i++)
        {
            if(i==0)
            printf("a");
            else
            printf("%c",seq[(i-1)%seq.size()].second+'a');
        }
    }
}