问题3299--Buy Sticks

3299: Buy Sticks

[命题人 : ]
时间限制 : 1.000 sec  内存限制 : 64 MB

题目描述

Imyourgod need 3 kinds of sticks which have different sizes: 20cm, 28cm and 32cm. However the shop only sell 75-centimeter-long sticks. So he have to cut off the long stick. How many sticks he must buy at least.

输入

The first line of input contains a number t, which means there are t cases of the test data. There will be several test cases in the problem, each in one line. Each test cases are described by 3 non-negtive-integers separated by one space representing the number of sticks of 20cm, 28cm and 32cm. All numbers are less than 10^6.

输出

The output contains one line for each line in the input case. This line contains the minimal number of 75-centimeter-long sticks he must buy. Format are shown as Sample Output.

样例输入 Copy

2
3 1 1
4 2 2

样例输出 Copy

Case 1: 2
Case 2: 3