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 _1511_D {
    static int n, k, pointer;
    static int[] path, next;
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer line = new StringTokenizer(in.readLine());
        n = Integer.parseInt(line.nextToken());
        k = Integer.parseInt(line.nextToken());
        path = new int[k * k];
        next = new int[k];
        eulerian(0);
        StringBuilder sb = new StringBuilder();
        sb.append('a');
        for(int i = 0; i < n - 1; i++) {
            int val = path[i % path.length];
            sb.append((char)(val + 97));
        }
        out.println(sb.toString());
        in.close();
        out.close();
    }
    static void eulerian(int v) {
        while(next[v] < k) {
            int temp = next[v];
            next[v]++;
            eulerian(temp);
            path[pointer] = temp;
            pointer++;
        }
    }
}