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

public class ProblemD {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = scanner.nextInt();

        System.out.println(generateString(n, k));
    }

    private static String generateString(int n, int k) {
        String alphabet = "abcdefghijklmnopqrstuvwxyz";
        StringBuilder sb = new StringBuilder();
        int step_1 = 0;
        int step_2 = 1;

        while (sb.length() < n) {
            if (step_1 == k) {
                step_1 = 0;
                step_2 = 1;
            }

            sb.append(alphabet.charAt(step_1));

            while (step_2 < k) {
                sb.append(alphabet.charAt(step_1));
                sb.append(alphabet.charAt(step_2));
                step_2++;
            }
            step_1++;
            step_2 = step_1 + 1;
        }

        return sb.substring(0, n);
    }
}