Reverse

Time limit1sMemory limit512 MB

Summary

Given six output lines from related problems, print one possible input for each problem in order.

Level: Easy2 of 10
Topics: String, Implementation
Solved: No attempts yet

Problem

Dongho woke up from a dream and wants to write down what happened so he can turn it into a PS problem. His memory is poor, so he only remembers the final scene of each dream, not how the dream reached that scene.

To help Dongho recall his dreams, write a program that, given the possible outputs of Problem A (Re-verse), Problem B (Rebirth), Problem C (Reveals), Problem D (Reversal), Problem E (Reavers), and Problem F (Reversi), prints any one of the possible inputs.

Input

The input has six lines.

The number of times Siyi sang a song in Problem A.
Whether Siyi was able to go to dimension 0 in Problem B, given as a yes or no value.
The name of the culprit who ate Siyi's cake in Problem C.
The length along the axis direction of the largest hyper-stargate that enters Siyi's room in Problem D.
The minimum number of Reavers and Scarabs in Problem E.
For each game Siyi played at the "World Reversi Championship" in Problem F, whether it was a win, a loss, or a draw.

Output

For each problem, print a possible input data for the given output, in order.

Hint

Whitespace and line breaks must match exactly, or your answer may be judged wrong.

Examples1

Example 1

Input

2
utopia
dongho
1
3
LDW

Expected output

5
AABBA
3 2 3
1 2
0 1
2 1
0
swi's cake is missing!
5
dongho
potato
cake
bumin
dhyang
5
dongho
dongho
dongho
dongho
dongho
1 2 3 4
1 1 0 0
0 0 0 1
1 1 0 0
0 1 1 1
1 0 0 1
0 1 0 0
10
9 1
9 0
10 1
10 0
7 0
4 1
6 1
7 0
5 0
7 0
3
1 3
2 2
1 1