M. META
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There are 12 clues for this puzzle. Each problem corresponds to exactly one clue, so solving problem B will give you clue B, and solving problem E will give you clue E. To get clues, submit a clarification with links to your AC submissions, and you will receive clues for those problems. This puzzle might be possible without all the clues, but it will be harder.

Magikarp arrives in a place full of undirected acyclic connected graphs to collect his final prize. "These undirected acyclic connected graphs could really use a trim," Magikarp thinks, as he arrives at a glowing treasure chest.

When he tries to open it, he discovers a large lock sealing the chest shut.

What should Magikarp do to get his final prize?

1. [5] -> 8

2. [5] -> 3

3. [2,3] -> 16, 15

4. [1] -> 11

5. [1,3] -> 10, 12

6. [2] -> 1

7. [5] -> 2

8. [3,5] -> 7, 6

9. [1] -> 14

10. [5] -> 5

11. [4,5] -> 9, 13

12. [1] -> 4

Output

Your final answer will be 4 words. Submit them all on separate lines, with proper capitalization.

Example
Input
What will the answer be?
Output
What will the answer be?
Note

There is intermediate answer checking for this puzzle, at the cost of a WA submission. To do this, submit a solution that prints out a single string of capitalized letters, so if your answer to a clue is "fish", submit "FISH". If your answer to a clue is "magic carp", submit "MAGICCARP". You will receive a WA verdict for this.

If you want a hint on this problem and this problem only, submit a solution that prints out the following text (don't worry about line breaks, but capitalization and punctuation will matter):

where X is the number of this hint (starting from 1). Then, submit a clarification with a link to this submission, along with what you want to ask for the hint.