Alisa and Yulia, 6-B students at a Moscow school, are preparing for a programming competition together. In order to perform well at the Olympiad, they must solve all the problems of the training contest.
The girls have n tasks in total. Alice can accurately solve p contest problems. Yulia can only solve q problems of the same contest. You have information about the numbers of problems that Alice can solve and the numbers of problems that Yulia can solve. Will the girls be able to solve all the problems of this contest and perform well at the Olympiad if they unite their efforts and solve the context together?
Input
The first line contains a single integer n (1 <= n <= 100).< /p>
The next line is an integer first p (0 <= p <=n) followed by p various integers a1, a2< /code>, ..., ap (1 <= ai <= n). These numbers indicate the numbers of problems that Alice can solve. The next line contains the numbers of problems that Yulia can solve in a similar format. Tasks are assumed to be numbered from 1 to n.
Output
If the girls can solve all the problems together, print "I'm winner!". If this is not possible, print "Oh!" (without quotes) and from a new line of problems that girls cannot solve (problem numbers should be output in ascending order, separated by one space).
Examples
| # |
Input |
Output |
| 1 |
4
3 1 2 3
2 2 4
|
I'm winner! |
| 2 |
5
3 1 2 3
2 2 3
|
Oh!
4 5
|