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
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.
Print two strings $$$s$$$ and $$$t$$$ satisfying the conditions of the problem. If there are multiple answers, print any of them.
2 4
aa aaab
5 3
babba bab
30 30
abcdefghijklmnopqrstuvwxyzabca abcdefghijklmnopqrstuvwxyzabcb
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... |