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

import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class randoms {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);

        StringTokenizer st = new StringTokenizer(br.readLine());
        int N = Integer.parseInt(st.nextToken());
        int K = Integer.parseInt(st.nextToken());
        int cyc = K * (K - 1) / 2 + K;
        int idx = 0;
        l:
        while (true) {
            for (int i = 0; i < K; i++) {
                pw.print(toc(i));
                    idx++;
                    if (idx == N) {
                        break l;
                    }
                for (int j = i+1; j < K; j++) {
                    pw.print(toc(i));
                    idx++;
                    if (idx == N) {
                        break l;
                    }
                    pw.print(toc(j));
                    idx++;
                    if (idx == N) {
                        break l;
                    }
                }
            }
        }
//        long ret = K*K*(N/cyc);
//        ret += (N%cyc - 1)*cyc;
//        pw.println(ret);
        pw.close();
        br.close();
    }

    static char toc(int a) {
        return (char) ('a' + a);
    }
}
