//STATUS:C++_AC_500MS_1012KB

 #include <functional>

 #include <algorithm>

 #include <iostream>

 //#include <ext/rope>

 #include <fstream>

 #include <sstream>

 #include <iomanip>

 #include <numeric>

 #include <cstring>

 #include <cassert>

 #include <cstdio>

 #include <string>

 #include <vector>

 #include <bitset>

 #include <queue>

 #include <stack>

 #include <cmath>

 #include <ctime>

 #include <list>

 #include <set>

 #include <map>

 using namespace std;

 //using namespace __gnu_cxx;

 //define

 #define pii pair<int,int>

 #define mem(a,b) memset(a,b,sizeof(a))

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define PI acos(-1.0)

 //typedef

 typedef __int64 LL;

 typedef unsigned __int64 ULL;

 //const

 const int N=;

 const int INF=0x3f3f3f3f;

 const int MOD=,STA=;

 const LL LNF=1LL<<;

 const double EPS=1e-;

 const double OO=1e15;

 const int dx[]={-,,,};

 const int dy[]={,,,-};

 const int day[]={,,,,,,,,,,,,};

 //Daily Use ...

 inline int sign(double x){return (x>EPS)-(x<-EPS);}

 template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}

 template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}

 template<class T> inline T lcm(T a,T b,T d){return a/d*b;}

 template<class T> inline T Min(T a,T b){return a<b?a:b;}

 template<class T> inline T Max(T a,T b){return a>b?a:b;}

 template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}

 template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}

 template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}

 template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}

 //End

 struct Node{

     int a,b;

 }p[N];

 int vis[N];

 int T,n,m;

 int cmp(Node a,Node b)

 {

     return a.a<b.a;

 }

 int main()

 {

  //   freopen("in.txt","r",stdin);

     int ca=,i,j,a,b,sum,low,flag;

     int cnt1,ans1,cnt2,ans2;

     scanf("%d",&T);

     while(T--)

     {

         low=INF;

         cnt1=ans1=cnt2=ans2=sum=;

         scanf("%d%d",&n,&m);

         for(i=;i<n;i++){

             scanf("%d%d",&p[i].a,&p[i].b);

             if(p[i].b)sum+=p[i].b;

         }

         sort(p,p+n,cmp);

         for(i=;i<n;i++){

             if(p[i].b)continue;

             if(ans1+p[i].a>m)break;

             ans1+=p[i].a;

             cnt1++;

         }

         for(i=;i<n;i++)

             if(p[i].b){flag=i;low=p[i].a;break;}

         if(low<=m){

             ans2=low;

             if(sum+>=n)cnt2=n;

             else {

                 cnt2=sum+;

                 n-=sum;

                 if(flag>=n)n--;

                 for(i=;i<n;i++){

                     if(i==flag)continue;

                     if(ans2+p[i].a>m)break;

                     ans2+=p[i].a;

                     cnt2++;

                 }

             }

         }

         if(cnt2>cnt1 || (cnt2==cnt1 && ans2<ans1)){

             swap(ans1,ans2);swap(cnt1,cnt2);

         }

         printf("Case %d: %d %d\n",ca++,cnt1,ans1);

     }

     return ;

 }