12015

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,i,j,k[10000],l;
    string a;

    cin>>n;

    for(i=0; i<n; i++)
    {
        vector< pair <int,string> > ranks;
        for(j=0; j<10; j++)
        {
            cin>>a>>k[j];
            ranks.push_back(make_pair(k[j],a));
        }
        l=max(l,k[j]);
        cout<<l<<endl;
        //reverse(ranks.begin(),ranks.end());
        // l=ranks[0].first;
        cout<<"Case #"<<i+1<<":"<<endl;
        for(j=0; j<10; j++)
        {
            if(ranks[j].first == l)
                cout <<ranks[j].second<<endl;
        }
    }
    return 0;
}