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;

void domain_expansion_() {
  int n, k;
  cin >> n >> k;
  string ans = "";
  int c = 0;
  while (ans.size() < n) {
    ans += c + 'a';
    for (int i = c + 1; i < k; i++) {
      ans += c + 'a';
      ans += i + 'a';
    }
    c++;
    c %= k;
  }
  for (int i = 0; i < n; i++) cout << ans[i];
  cout << '\n';
  return;
}

int main () {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  // cin >> tt;
  while (tt--) 
    domain_expansion_();
  return 0; 
}