#include<bits/stdc++.h>
using namespace std;
void solve(int tc)
{
    int one1,one2,one3,l; cin>>one1>>one2>>one3>>l;
    int two2 = l/2;
    l -= (two2*2);
    int ans=0;
    ans += min(two2,one3);
    two2 -= min(two2,one3);
    one3 -= min(two2,one3);

    ans += min(two2,min(one1,one2));
    two2 -= min(two2,min(one1,one2));
    one1 -= min(two2,min(one1,one2));
    one2 -= min(two2,min(one1,one2));

    ans += min(two2,one1/3);
    two2 -= min(two2,one1/3);
    one1 -= min(two2,one1/3);

    //l += two2*2;
    if(l==1)
    {
        if(one3 && one2 && one1)
        {
            ans+=1;
            one3--;
            one1--;
            one2--;
        }
        else if(one2>=3)
        {
            ans++;
            one2-=3;
        }
        else if(one2>=2 && one1>=2)
        {
            ans++;
            one2-=2;
            one1-=2;
        }
        else if(one1>=6)
        {
            ans++;
            one1-=6;
        }
    }
    ans += (one3)/3;
    one3 -= (one3)/3;
    if(one3==2)
    {
        if(one1 && one2)
        {
            ans++;
            one3=0;
            one1--;
            one2--;
        }
        else if(one1>=3)
        {
            ans++;
            one3=0;
            one1-=3;
        }
    }
    else if(one3==1)
    {
        if(one2*2+one1 >=6)
        {
            ans++;
            one2 -= max(3,one2);
            one1 -= 6-max(3,one2)*2;
        }
    }
    ans += min((one2*2+one1)/9 , one1);
    cout<<"Case "<<tc<<": ";
    cout<<ans<<endl;
}
int main(){int t; cin>>t; for(int i=1;i<=t;i++) solve(i);}