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:
#pragma GCC optimize(3,"Ofast","inline")
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include<string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>
using namespace std;
int a[30][30];
int main()
{
	//freopen("in.txt","r",stdin);
	int n,k;
	cin>>n>>k;
	if(n==1) cout<<"a";
	else if(n==2) cout<<"aa";
	else
	{
	cout<<"a";
	//a[1][1]++;
	char pre='a';
	for(int i=1;i<=n-1;i++)
	{
		//cout<<pre; 
		int min1=0x3f3f3f3f;
		int loc=-1;
		for(int j=k;j>=1;j--)
		{
			if(a[pre-'a'+1][j]<min1) 
			{
				min1=a[pre-'a'+1][j];
				loc=j;
			}
		}
		cout<<(char)(loc+'a'-1);
		//cout<<pre-'a'+1<<" "<<loc+'a'-1<<" ";
		a[pre-'a'+1][loc]++;
		pre=(char)(loc+'a'-1);
	}
	//cout<<a[1][2];
	}
	
	  
}