#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int A,B;
int a[4]={1000,1500,2000,2500};
int main()
{
    int t,ca=0;
    cin>>t;
    while(t--)
    {
        int sum=0;
        for(int i=0;i<4;i++){
            int ret=0;
            cin>>A>>B;
            ret=max(2*a[i]/5,(250-A)*a[i]/250-B*50);
            sum+=ret;
        }
        printf("Case #%d: %d\n",++ca,sum);
    }
    return 0;
}