Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K Special Judge

Total Runs: 1249 Accepted Runs: 845 Multiple test files

Every day, while the dwarves are busy in the mines, Snow White prepares dinner for them; seven chairs, seven plates, seven forks and seven knives for seven hungry dwarves.### Input

There are 9 lines of input. Each contains an integer between 1 and 99 (inclusive). All of the numbers will be distinct.### Output

Your program must produce exactly seven lines of output - the numbers on the hats of Snow White's seven dwarves. Output the numbers in any order.### Sample Input #1

### Sample Output #1

### Sample Input #2

### Sample Output #2

One day nine dwarves came from the mines instead of seven (nobody knows how or why), each of them claiming to be one of Snow White's seven dwarves.

Luckily, each dwarf wears a hat with a positive integer less than 100 written on it. Snow White, a famous mathematician, realised long ago that the sum of numbers on the hats of her seven dwarves was exactly 100.

Write a program which determines which dwarves are legit, i.e. pick seven of nine numbers that add to 100.

Note: The test data will be such that the solution is unique.

7 8 10 13 15 19 20 23 25

7 8 10 13 19 20 23

8 6 5 1 37 30 28 22 36

8 6 5 1 30 28 22

**Note:** Special judge problem, you may get "Wrong Answer" when output in wrong format.

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz