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.*;

public class cf1511_Div2_D {
	
	
	public static void main(String args[]) throws IOException {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int k = in.nextInt();
		// k^2
		StringBuilder str = new StringBuilder("aa");
		
		for (char i = 'b'; i < 'a' + k; i++) {
			i = (char)(i);
			char before = (char)(i - 1);
			StringBuilder temp = new StringBuilder("");
			for (char j = 'a'; j < i; j++) {
				j = (char)j;
				// System.out.println(i + " " + j);
				// System.out.println(temp);
				if (j == before) {
					if (temp.length() == 0)
						temp.append(i + "");
					temp.append(str);
					temp.append(i + "");
				}
				else {
					if (temp.length() == 0)
						temp.append(i + "");
					temp.append(j + "");
					temp.append(i + "");
				}
			}
			temp.append(i + "");
			str = temp;
		}
		
		int curr = 0;
		for (int i = 0; i < n; i++) {
			if (curr >= str.length()) {
				curr = 1;
			}
			out.print(str.charAt(curr));
			curr++;
		}
		
		out.close();
	}
	
	static class FastScanner {
	    BufferedReader br;
	    StringTokenizer st;
		
	    public FastScanner(InputStream i) {
	        br = new BufferedReader(new InputStreamReader(i));
	        st = new StringTokenizer("");
	    }
				
	    public String next() throws IOException {
	        if(st.hasMoreTokens())
	            return st.nextToken();
	        else
	            st = new StringTokenizer(br.readLine());
	        return next();
	    }

	    public int nextInt() throws IOException {
	        return Integer.parseInt(next());
	    }
	    //#
	    public long nextLong() throws IOException {
	        return Long.parseLong(next());
	    }
	    public double nextDouble() throws IOException {
	        return Double.parseDouble(next());
	    }
	    //$
	}
}
