C. Almost Equal Closures
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

Let's call the closure of a non-empty string $$$s$$$ the infinite string $$$C(s)$$$ obtained by concatenating $$$s$$$ with itself infinitely many times.

For example, $$$C(\text{x})$$$ $$$=$$$ xxxxxx..., $$$C(\text{uw})$$$ $$$=$$$ uwuwuwuwuwu..., $$$C(\text{abac})$$$ $$$=$$$ abacabacabacabac....

You are given two integers $$$n$$$ and $$$m$$$. Your task is to construct two strings $$$s$$$ and $$$t$$$ such that

  1. strings $$$s$$$ and $$$t$$$ consist of lowercase Latin letters;
  2. the length of $$$s$$$ is $$$n$$$;
  3. the length of $$$t$$$ is $$$m$$$;
  4. $$$C(s)$$$ and $$$C(t)$$$ are different, but the first position at which they differ is as far to the right as possible.
Input

The first and only line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n, m \le 10^6$$$) — the lengths of strings $$$s$$$ and $$$t$$$, respectively.

Output

Print two strings $$$s$$$ and $$$t$$$ satisfying the conditions of the problem. If there are multiple answers, print any of them.

Examples
Input
2 4
Output
aa
aaab
Input
5 3
Output
babba
bab
Input
30 30
Output
abcdefghijklmnopqrstuvwxyzabca
abcdefghijklmnopqrstuvwxyzabcb
Note

In the first example, the closures are:

$$$C(\text{aa})$$$$$$=$$$aaaaaa...
$$$C(\text{aaab})$$$$$$=$$$aaabaa...

In the second example, the closures are:

$$$C(\text{babba})$$$$$$=$$$babbababb...
$$$C(\text{bab})$$$$$$=$$$babbabbab...