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.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class D implements Runnable {
    public static void main(String args[]) throws Exception {
        new Thread(null, new D(), "D", 1 << 27).start();
    }

    long gcd(long n1, long n2) {
        if (n2 == 0) {
            return n1;
        }
        return gcd(n2, n1 % n2);
    }

    void merge1(int arr[], int l, int m, int r) {
        int n1 = m - l + 1;
        int n2 = r - m;
        int L[] = new int[n1];
        int R[] = new int[n2];
        for (int i = 0; i < n1; ++i)
            L[i] = arr[l + i];
        for (int j = 0; j < n2; ++j)
            R[j] = arr[m + 1 + j];
        int i = 0, j = 0;
        int k = l;
        while (i < n1 && j < n2) {
            if (L[i] <= R[j]) {
                arr[k] = L[i];
                i++;
            } else {
                arr[k] = R[j];
                j++;
            }
            k++;
        }
        while (i < n1) {
            arr[k] = L[i];
            i++;
            k++;
        }
        while (j < n2) {
            arr[k] = R[j];
            j++;
            k++;
        }
    }

    void sort1(int arr[], int l, int r) {
        if (l < r) {
            int m = (l + r) / 2;
            sort1(arr, l, m);
            sort1(arr, m + 1, r);
            merge1(arr, l, m, r);
        }
    }

    public void run() {
        try {
            InputReader in = new InputReader(System.in);
            PrintWriter out = new PrintWriter(System.out);
            int n = in.ni();
            int k = in.ni();
            StringBuilder result = new StringBuilder();
            result.append((char)('a' + k - 1));
            result.append((char)('a' + k - 1));
            for (char ch1 = 'a'; ch1 < 'a' + k - 1; ch1++) {
                result.append(ch1);
                for (char ch2 = (char) (ch1 + 1); ch2 < 'a' + k; ch2++) {
                    result.append(ch1);
                    result.append(ch2);
                }
            }
            result.deleteCharAt(result.length() - 1);
            String loop = result.toString();

            int m = loop.length();
            int div = n / m;
            int rem = n % m;

            result = new StringBuilder();
            for (int d = 0; d < div; d++) {
                result.append(loop);
            }
            result.append(loop, 0, rem);
            out.println(result);
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
            //throw new RuntimeException();
        }
    }

    static class pair implements Comparable {
        int f;
        int s;

        pair(int fi, int se) {
            f = fi;
            s = se;
        }

        public int compareTo(Object o)//asc order
        {
            pair pr = (pair) o;
            if (s > pr.s)
                return 1;
            if (s == pr.s) {
                if (f > pr.f)
                    return 1;
                else
                    return -1;
            } else
                return -1;
        }

        public boolean equals(Object o) {
            pair ob = (pair) o;
            if (o != null) {
                if ((ob.f == this.f) && (ob.s == this.s))
                    return true;
            }
            return false;
        }

        public int hashCode() {
            return (this.f + " " + this.s).hashCode();
        }
    }

    static class InputReader {

        private final InputStream stream;
        private final byte[] buf = new byte[8192];
        private int curChar, snumChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (snumChars == -1)
                throw new InputMismatchException();
            if (curChar >= snumChars) {
                curChar = 0;
                try {
                    snumChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int ni() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nl() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int[] nextIntArray(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }

    }

    public class triplet implements Comparable {
        int f;
        int s;
        long t;

        triplet(int f, int s, long t) {
            this.f = f;
            this.s = s;
            this.t = t;
        }

        public boolean equals(Object o) {
            triplet ob = (triplet) o;
            if (o != null) {
                if ((ob.f == this.f) && (ob.s == this.s) && (ob.t == this.t))
                    return true;
            }
            return false;
        }

        public int hashCode() {
            return (this.f + " " + this.s + " " + this.t).hashCode();
        }

        public int compareTo(Object o)//desc order
        {
            triplet tr = (triplet) o;
            if (t > tr.t)
                return -1;
            else if (t == tr.t) {
                if (f > tr.f)
                    return 1;
                else
                    return -1;
            } else
                return 1;
        }
    }
}