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 Main {

    public static void main(String[] args) throws Exception {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt(), k = s.nextInt();
        StringBuilder str = new StringBuilder("a");

        Set<Integer>[] abc = new HashSet[k];
        for (int i = 0; i < k; i++) {
            abc[i] = new HashSet<>();
        }
        int counter = k * k;
        int prev = 0;
        boolean added = true;
        while (str.length() < n && added) {
            added = false;
            for (int j = 0; j < k && !added; j++) {
                if (!abc[prev].contains(j) && abc[j].size() < k) {
                    abc[prev].add(j);
                    str.append((char) (j + 'a'));
                    prev = j;
                    added = true;
                }
            }
        }
        while (str.length() < n) {
            str.append(str);
        }
        System.out.println(str.substring(0, n));

    }
}
//ab
//a
//
//aaba