#P1511D. Min Cost String
Min Cost String
Description
Let's define the cost of a string as the number of index pairs and () such that and .
You are given two positive integers and . Among all strings with length that contain only the first 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.
The only line contains two integers and ().
Print the string such that it consists of characters, each its character is one of the first Latin letters, and it has the minimum possible cost among all these strings. If there are multiple such strings — print any of them.
Input
The only line contains two integers and ().
Output
Print the string such that it consists of characters, each its character is one of the first Latin letters, and it has the minimum possible cost among all these strings. If there are multiple such strings — print any of them.