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<iostream>
using namespace std;
string s;
int main(){
	int n,k;
	cin>>n>>k;
	int w=0;
	if(k==1){
		for(int i=1;i<=n;i++)cout<<'a';
		return 0;
	}
	for(int i=1;i<=k;i++){
		for(int j=i;j<=k;j++){
			s+=char(i+'a'-1);w++;
			if(j!=i)s+=char(j+'a'-1),w++;
		}
	}
	for(int i=0;i<n;i++)cout<<s[i%(w)];
	return 0;
}