# ZYB loves Score

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

## Description

One day,ZYB participated in the BestCoder Contest

There are four problems. Their scores are 1000,1500,2000,2500

According to the rules of BestCoder,If you solve one problem at $x$ minutes,
You will get (250-x)/250$*$100$\%$ of the original scores.

Obviously the final score must be an integer,becasue the original scores are multiple of 250

And if you make $x$ wrong submissions，the score of this problem you get will be reduced by 50$*$x

For example, if you solved the first problem in 5 minutes and you make one wrong submisson, the score of this problem is 980-50=930

To prevent very low scores,the lowest score of one problem is $40\%$ of its original score

## Input

Multiple test cases, the first line contains an integer T(no more than 20), indicating the number of cases. Each test case contains four lines

For i-th line of each test case there are two integers $A$,$B$ which means you solved the i-th problem in A minutes and you have made B wrong submissons.

$0\leq A\leq 105$，$0\leq B\leq 100$

## Output

For each case, the output should occupies exactly one line. The output format is Case #x: ans, here x is the data number begins at 1.

## Sample Input

2
4 0
12 0
20 0
103 0
17 1
29 0
57 0
84 0

## Sample Output

Case #1: 5722
Case #2: 5412

hujie

## Source

BestCoder Round #44