Farmer John has three milking buckets of capacity A, B, and C quarts. Each of the numbers A, B, and C is an integer from 1 through 20, inclusive. Initially, buckets A and B are empty while bucket C is full of milk. Sometimes, FJ pours milk from one bucket to another until the second bucket is filled or the first bucket is empty. Once begun, a pour must be completed, of course. Being thrifty, no milk may be tossed out.

Write a program to help FJ determine what amounts of milk he can leave in bucket C when he begins with three buckets as above, pours milk among the buckets for a while, and then notes that bucket A is empty.

Input specifications:
A single line with the three integers A, B, and C where 0 < A, B, C ≤ 20.

Output specifications:
A single line with a sorted list of all the possible amounts of milk that can be in bucket C when bucket A is empty.
0 < Values in ascending order ≤ C.

Sample Input 1:
8 9 10

Sample Output 1:
1 2 8 9 10

Sample Input 2:
2 5 10

Sample Output 2:
5 6 7 8 9 10

Для отправки решений необходимо выполнить вход.