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.io.*;
import java.util.*;

public class Codeforces
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder();
        String s[]=bu.readLine().split(" ");
        int n=Integer.parseInt(s[0]),k=Integer.parseInt(s[1]);
        int i,c[]=new int[n+5],g[][]=new int[k][k],used[]=new int[k];

        c[0]=0; c[1]=0; g[0][0]++; used[0]=1;
        for(i=1;i<n-1;i++)
        {
            int cur=c[i],j,min=Integer.MAX_VALUE,minv=-1,min2=Integer.MAX_VALUE;
            for(j=0;j<k;j++)
            if(g[cur][j]<min)
            {
                min=g[cur][j];
                minv=j;
                for(int l=0;l<k;l++)
                min2=Math.min(min2,g[j][l]);
            }
            else if(g[cur][j]==min)
            {
                int l;
                for(l=0;l<k;l++)
                if(g[j][l]<min2) break;
                if(l!=k) minv=j;
            }
            c[i+1]=minv;
            g[cur][minv]++; used[cur]++;
        }
        for(i=0;i<n;i++) sb.append((char)('a'+c[i]));
        System.out.println(sb);
    }
}