#include <bits/stdc++.h>
using namespace std;
void File() {}
int gcd(int a, int b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int lower_bound(int l1, int r1, int x1, vector<int> arr) {
  int l = l1, r = r1, cur = -1, md, x = x1;
  while (l <= r) {
    md = (l + r) / 2;
    if (arr[md] <= x) {
      cur = md;
      l = md + 1;
    } else {
      r = md - 1;
    }
  }
  if (cur != -1 && arr[cur] == x)
    return cur;
  else
    return -1;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  int i = 1;
  while (n--) {
    cout << char(i + 96);
    i++;
    if (i > k) {
      i %= k;
    }
  }
  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 File() {}
int gcd(int a, int b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int lower_bound(int l1, int r1, int x1, vector<int> arr) {
  int l = l1, r = r1, cur = -1, md, x = x1;
  while (l <= r) {
    md = (l + r) / 2;
    if (arr[md] <= x) {
      cur = md;
      l = md + 1;
    } else {
      r = md - 1;
    }
  }
  if (cur != -1 && arr[cur] == x)
    return cur;
  else
    return -1;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  int i = 1;
  while (n--) {
    cout << char(i + 96);
    i++;
    if (i > k) {
      i %= k;
    }
  }
  return 0;
}

```