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.*;
public class MinCostString {
	private static StreamTokenizer st;
	private static int nextInt()throws IOException{
		st.nextToken();
		return (int)st.nval;
	}
	public static void main(String[] args) throws IOException{
		st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		int n = nextInt(), k = nextInt();
		StringBuilder sb = new StringBuilder();
		int cnt = 0;
		loop : for(int i = 0; i < (int)Math.ceil((double)n/(k*k)); ++i) {
			for(int j = 0; j < k; ++j) {
				sb.append((char)('a'+j));
				++cnt;
				if(cnt == n)break loop;
				for(int a = j+1; a < k; ++a) {
					sb.append((char)('a'+j));
					++cnt;
					if(cnt == n)break loop;
					sb.append((char)('a'+a));
					++cnt;
					if(cnt == n)break loop;
				}
			}
		}
		PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		pw.println(sb.toString());
		pw.close();
		// d370110fa6a6c407879bcbac6d1877aee2dd2d398a7acc338b48b97040d1150c
	}

}