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.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.util.BitSet;
import java.util.function.BinaryOperator;

public class D {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static FastReader s = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    private static int[] rai(int n) {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextInt();
        }
        return arr;
    }

    private static int[][] rai(int n, int m) {
        int[][] arr = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = s.nextInt();
            }
        }
        return arr;
    }

    private static long[] ral(int n) {
        long[] arr = new long[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextLong();
        }
        return arr;
    }

    private static long[][] ral(int n, int m) {
        long[][] arr = new long[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = s.nextLong();
            }
        }
        return arr;
    }

    private static int ri() {
        return s.nextInt();
    }

    private static long rl() {
        return s.nextLong();
    }

    private static String rs() {
        return s.next();
    }

    static int gcd(int a,int b)
    {
        if(b==0)
        {
            return a;
        }
        return gcd(b,a%b);
    }
    static long gcd(long a,long b)
    {
        if(b==0)
        {
            return a;
        }
        return gcd(b,a%b);
    }

    static int MOD=(int)1e9+7;
    public static void main(String[] args) {
        StringBuilder ans = new StringBuilder();
//        int t = ri();
        int t=1;
        while(t-- >0) {
            int n=ri();
            int k =ri();

            StringBuilder mid = new StringBuilder();
            TreeSet<Character>[] set=new TreeSet[26];
            for(int i=0;i<k;i++)
            {
                set[i]=new TreeSet<>();
                for(int j=0;j<k;j++)
                {
                    set[i].add((char)(j+'a'));
                }
            }
            for(int i=0;i<k;i++)
            {
                char c= (char) (i+'a');
                mid.append(c).append(c);
                set[i].remove(c);
                set[i].remove((char)(c+1));
            }

            char last = (char)(k+'a'-1);

            boolean small = true;

            while(true)
            {
                if(small)
                {
                    int ind = last-'a';
                    if(set[ind].size()==0)
                    {
                        break;
                    }
                    char c = set[ind].first();
                    mid.append(c);
                    set[ind].remove(c);
                    last = c;
                    small=false;
                }
                else {
                    int ind = last-'a';
                    if(set[ind].size()==0)
                    {
                        break;
                    }
                    char c = set[ind].last();
                    mid.append(c);
                    set[ind].remove(c);
                    last = c;
                    small=true;
                }
            }

            String str = mid.toString();
            str= str.substring(1);

            StringBuilder res = new StringBuilder();
            res.append('a');
            while(res.length()<=n)
            {
                res.append(str);
            }

            String val = res.toString();
            ans.append(val, 0, n).append("\n");
        }
        out.print(ans.toString());
        out.flush();

    }

}