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
import java.util.*;
import java.io.*;
public class Main
{
	public static void main(String[] args)throws Exception
	{
	    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	    PrintWriter pw=new PrintWriter(System.out);
	    String s[]=(br.readLine()).split(" ");
	    int n=Integer.parseInt(s[0]);
	    int k=Integer.parseInt(s[1]);
	    boolean vis[][]=new boolean[k][k];
	    char ch[]=new char[k*k];
	    ch[0]='a';
	    int ct[]=new int[k];
	    ct[0]=1;
	    
	    for(int i=1;i<k*k;i++)
	    {
	        int let=ch[i-1]-'a';
	        for(int j=0;j<k;j++)
	        {
	            if(ct[j]==k)
	            {
	                continue;
	            }
	            if(vis[let][j]==false)
	            {
	                char x=(char)(j+97);
	                ch[i]=x;
	                ct[j]++;
	                vis[let][j]=true;
	                break;
	                
	            }
	        }
	    }
	   /* for(int i=0;i<k*k;i++)
	    {
	        pw.print(ch[i]);
	    }*/
	    int l=k*k;
	    int n2=n;
	    int in=0;
	    while(n2!=0)
	    {
	        in=in%l;
	        pw.print(ch[in]);
	        in++;
	        n2--;
	    }
	    pw.println();
	    
	    pw.flush();
	}
}
