#include <bits/stdc++.h>
using namespace std;
void speed() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void convertString(string &s, char t) {
  if (t == 'L') {
    for (int i = 0; s[i] != '\0'; i++)
      if (s[i] >= 65 && s[i] <= 90) s[i] += 32;
  } else {
    for (int i = 0; s[i] != '\0'; i++)
      if (s[i] >= 97 && s[i] <= 122) s[i] -= 32;
  }
}
int compare_two_values(double a, double b) {
  if (fabs(a - b) <= 1e-10) return 0;
  return a > b ? 1 : -1;
}
int main() {
  speed();
  short n, d, c = 0;
  cin >> n >> d;
  for (char i = 'a'; n > 0; n--) {
    cout << i;
    c++;
    if (c == 26 || c == d)
      c = 0, i = 'a';
    else
      i++;
  }
  return 0;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. 

Innokentiy decides that new password should satisfy the following conditions:

  * the length of the password must be equal to n, 
  * the password should consist only of lowercase Latin letters, 
  * the number of distinct symbols in the password must be equal to k, 
  * any two consecutive symbols in the password must be distinct. 



Your task is to help Innokentiy and to invent a new password which will satisfy all given conditions. 

Input

The first line contains two positive integers n and k (2 ≤ n ≤ 100, 2 ≤ k ≤ min(n, 26)) — the length of the password and the number of distinct symbols in it. 

Pay attention that a desired new password always exists.

Output

Print any password which satisfies all conditions given by Innokentiy.

Examples

Input

4 3


Output

java


Input

6 6


Output

python


Input

5 2


Output

phphp

Note

In the first test there is one of the appropriate new passwords — java, because its length is equal to 4 and 3 distinct lowercase letters a, j and v are used in it.

In the second test there is one of the appropriate new passwords — python, because its length is equal to 6 and it consists of 6 distinct lowercase letters.

In the third test there is one of the appropriate new passwords — phphp, because its length is equal to 5 and 2 distinct lowercase letters p and h are used in it.

Pay attention the condition that no two identical symbols are consecutive is correct for all appropriate passwords in tests. 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void speed() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void convertString(string &s, char t) {
  if (t == 'L') {
    for (int i = 0; s[i] != '\0'; i++)
      if (s[i] >= 65 && s[i] <= 90) s[i] += 32;
  } else {
    for (int i = 0; s[i] != '\0'; i++)
      if (s[i] >= 97 && s[i] <= 122) s[i] -= 32;
  }
}
int compare_two_values(double a, double b) {
  if (fabs(a - b) <= 1e-10) return 0;
  return a > b ? 1 : -1;
}
int main() {
  speed();
  short n, d, c = 0;
  cin >> n >> d;
  for (char i = 'a'; n > 0; n--) {
    cout << i;
    c++;
    if (c == 26 || c == d)
      c = 0, i = 'a';
    else
      i++;
  }
  return 0;
}

```