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 main()
{
  long long int n,characters=0;
  int k,x,y,offset;
  cin>>n>>k;
  int arr[k][k],index[k];
  for(x=0;x<k;x++){
    offset=97+x;
    index[x]=0;
  for(y=0;y<k;y++)
  {
    arr[x][y]=offset+y;
    if(arr[x][y]>=97+k)
    {
      arr[x][y]-=k;
    }
    //cout<<(char)arr[x][y]<<" ";
  }
  //cout<<endl;
  }
  x=y=0;
  while(characters<n)
  {
    int l=arr[x][y];
    cout<<(char) l;
    index[x]++;
    if(index[x]>=k)
    index[x]-=k;
    x=l-97;
    y=index[x];
    characters++;
  }
}