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.*;

public class MinCost {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int info[][] = new int[k][k];
        char s[] = new char[n];
        s[0] = 'a';
        System.out.print(s[0]);

        for(int i = 1; i < n; i++) {
            int min = info[s[i-1] - 97][0] + info[0][0];
            int idx = 0;
            for(int j = 0; j < k; j++) {
                for(int l = 0; l < k; l++) {
                    if(min > info[s[i-1] - 97][j] + info[j][l]) {
                        min = info[s[i-1] - 97][j] + info[j][l];
                        idx = j;
                    }
                }
            }
            s[i] = (char)(idx + 97);
            info[s[i-1] - 97][idx]++;
            System.out.print(s[i]);
        }
    }
}