Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. New Year Letter

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMany 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*_{1} anf *s*_{2}, 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*_{1} should have length *n*, and string *s*_{2} 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*_{1} and *s*_{2} in the required manner. Help Vasya.

Input

The first line contains four integers *k*, *x*, *n*, *m* (3 ≤ *k* ≤ 50; 0 ≤ *x* ≤ 10^{9}; 1 ≤ *n*, *m* ≤ 100).

Output

In the first line print string *s*_{1}, consisting of *n* uppercase English letters. In the second line print string *s*_{2}, 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.

Examples

Input

3 2 2 2

Output

AC

AC

Input

3 3 2 2

Output

Happy new year!

Input

3 0 2 2

Output

AA

AA

Input

4 3 2 1

Output

Happy new year!

Input

4 2 2 1

Output

Happy new year!

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2019 02:53:24 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|