#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
bool square(long long x) {
  long long y;
  y = sqrt(x);
  if (y * y == x)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long q = 1, t;
  long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, p = 0, g = 0, h = 0,
            i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, r = 0, u = 0,
            w = 0, x = 0, y = 0, z = 0;
  long long flag = 0, flag1 = 0, co = 0, co1 = 0, co2 = 0, co3 = 0;
  long long ma = 0, mi = 100000000000;
  string str, str1, str2;
  cin >> n >> k;
  char ch = 'a';
  for (i = 0, j = 0; i < n; i++) {
    if (ch != 'z') {
      cout << ch;
      ch++;
      j++;
      if (j == k) ch = 'a', j = 0;
    } else {
      cout << ch;
      ch = 'a';
      j++;
      if (j == k) j = 0;
    }
  }
  cout << endl;
  ;
  return 0;
}

### Prompt

Create a solution in Cpp for 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;
long long mod = 1e9 + 7;
bool square(long long x) {
  long long y;
  y = sqrt(x);
  if (y * y == x)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long q = 1, t;
  long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, p = 0, g = 0, h = 0,
            i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, r = 0, u = 0,
            w = 0, x = 0, y = 0, z = 0;
  long long flag = 0, flag1 = 0, co = 0, co1 = 0, co2 = 0, co3 = 0;
  long long ma = 0, mi = 100000000000;
  string str, str1, str2;
  cin >> n >> k;
  char ch = 'a';
  for (i = 0, j = 0; i < n; i++) {
    if (ch != 'z') {
      cout << ch;
      ch++;
      j++;
      if (j == k) ch = 'a', j = 0;
    } else {
      cout << ch;
      ch = 'a';
      j++;
      if (j == k) j = 0;
    }
  }
  cout << endl;
  ;
  return 0;
}

```