Prepare a speech
Sema struggles with diction and pronunciation, making it sound as if his mouth is full of water when he speaks. In short, understanding him is quite challenging.
Tomorrow, Sema is scheduled to deliver a speech at the opening of an olympiad, but the speech text is not yet prepared. Yura has decided to assist his colleague by writing the speech. To ensure that the olympiad participants can comprehend Sema, Yura plans to make the speech a string of exactly n uppercase Latin letters, with the longest palindromic substring having a length of k.
Your task is to help Yura create such a speech for Sema.
Remember, a palindrome is a sequence that reads the same forwards and backwards.
Input Format:
The input consists of a single line containing two integers n and k (1 ≤ k ≤ n ≤ 47) — representing the desired length of the speech and the length of the longest palindromic substring, respectively.
Output Format:
Produce a string of length n composed of uppercase Latin letters that meets the specified condition. If multiple solutions exist, you may provide any one of them.