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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class _D_1511 {

    private static final FastScanner in = new FastScanner();
    private static final PrintWriter out = new PrintWriter(System.out);
    private static final PrintWriter err = new PrintWriter(System.err);

    static class Edge {

        int source;
        int target;

        public Edge(int source, int target) {
            this.source = source;
            this.target = target;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) {
                return true;
            }
            if (o == null || getClass() != o.getClass()) {
                return false;
            }

            Edge edge = (Edge) o;

            if (source != edge.source) {
                return false;
            }
            return target == edge.target;
        }

        @Override
        public String toString() {
            return String.valueOf((char) ('a' + source)) + (char) ('a' + target);
        }

        @Override
        public int hashCode() {
            int result = source;
            result = 31 * result + target;
            return result;
        }
    }

    /*
    Find Eulerian cycle in a graph, where vertex is letter from k-alphabet
    and edge is connecting every two letters
     */
    public static void solve() {
        int n = in.nextInt();
        int k = in.nextInt();

        if (k == 1) {
            out.println("a".repeat(n));
            return;
        }

        Set<Edge> visited = new HashSet<>();
        List<Edge> path = cycle(visited, 0, k);

        for (int i = 0; i < path.size(); i++) {
            path.addAll(i + 1, cycle(visited, path.get(i).target, k));
        }

        out.println(toString(path, n));
    }

    static List<Edge> cycle(Set<Edge> visited, int start, int k) {
        ArrayList<Edge> cycle = new ArrayList<>();
        int source = start;

        do {
            for (int target = 0; target < k; target++) {
                Edge edge = new Edge(source, target);
                if (!visited.contains(edge)) {
                    cycle.add(edge);
                    visited.add(edge);
                    source = target;
                }
            }

        } while (source != start);

        return cycle;

    }

    static String toString(List<Edge> edges, int n) {
        StringBuilder sb = new StringBuilder();
        for (Edge e : edges) {
            sb.append((char)('a' + e.source));
        }
        String result = sb.toString();
        if (result.length() < n) {
            result = result.repeat(n / result.length() + 1);
        }
        return result.substring(0, n);
    }

    // Boilerplate
    public static void main(String[] args) {
        solve();

        err.close();
        out.close();
    }

    @SuppressWarnings("unused")
    static class FastScanner {

        StringTokenizer tok = new StringTokenizer("");
        BufferedReader in;

        FastScanner() {
            in = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (!tok.hasMoreElements()) {
                try {
                    tok = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }

            return tok.nextToken();
        }

        String nextLine() {
            String line;
            try {
                line = in.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
}