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 JAVA):

Solution:
import java.util.*;
import java.io.*;
public class Solution{
    public static void main(String arg[]){
        Scanner scan = new Scanner(System.in);
		int n = scan.nextInt(), k = scan.nextInt(), i;
		int [] arr = new int[26];
		System.out.print("a");
		ArrayList <Integer> list = new ArrayList<Integer>();
		dfs(0, k, arr, list);
		for (i = 1; i < n; ++i)
		{
		System.out.print((char)('a' + list.get(i%list.size())));
        }
    	System.out.println("");	
    }
	public static void dfs(int i, int k, int [] arr, ArrayList<Integer> list)
	{
	while (arr[i] < k)
	{
	int j = arr[i]++;
	dfs(j, k, arr, list);
	list.add(j);
	}
	}
}