New Year Letter

1000ms

262144K

Description:

Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year Eve (we Russians actually expect Santa for the New Year, not for Christmas).

Vasya has come up with an algorithm he will follow while writing a letter. First he chooses two strings, s₁ anf s₂, consisting of uppercase English letters. Then the boy makes string s_k, using a recurrent equation s_n = s_n - 2 + s_n - 1, operation '+' means a concatenation (that is, the sequential record) of strings in the given order. Then Vasya writes down string s_k on a piece of paper, puts it in the envelope and sends in to Santa.

Vasya is absolutely sure that Santa will bring him the best present if the resulting string s_k has exactly x occurrences of substring AC (the short-cut reminds him оf accepted problems). Besides, Vasya decided that string s₁ should have length n, and string s₂ should have length m. Vasya hasn't decided anything else.

At the moment Vasya's got urgent New Year business, so he asks you to choose two strings for him, s₁ and s₂ in the required manner. Help Vasya.

Input:

The first line contains four integers k, x, n, m (3 ≤ k ≤ 50; 0 ≤ x ≤ 10⁹; 1 ≤ n, m ≤ 100).

Output:

In the first line print string s₁, consisting of n uppercase English letters. In the second line print string s₂, consisting of m uppercase English letters. If there are multiple valid strings, print any of them.

If the required pair of strings doesn't exist, print "Happy new year!" without the quotes.

Sample Input:

3 2 2 2

Sample Output:

AC
AC

Sample Input:

3 3 2 2

Sample Output:

Happy new year!

Sample Input:

3 0 2 2

Sample Output:

AA
AA

Sample Input:

4 3 2 1

Sample Output:

Happy new year!

Sample Input:

4 2 2 1

Sample Output:

Happy new year!

Informação

Provedor Codeforces

Código CF379D