#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 int dp[][];

 int d[];

 int main (){

     int T,kase=;

     cin>>T;

     while (T--){

         int n,t;

         cin>>n>>t;

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

             cin>>d[i];

         }

         sort (d,d+n);

         memset (dp,,sizeof dp);

         dp[][]=;

         for (int k=;k<n;k++){

             for (int j=t;j>=d[k];j--){

                 for (int i=k+;i>;i--){

                     if (dp[i-][j-d[k]])

                         dp[i][j]=;

                 }

             }

         }

         int ans=;

         int time;

         int flag=;

         for (int i=n;i>=;i--){

             for (int j=t-;j>=;j--){//cout<<j<<" ";

                 if (dp[i][j]){

                     ans=i;

                     time=j;

                     flag=;

                     break ;

                 }

             }

             if (flag)

                 break ;

         }

         cout<<"Case "<<++kase<<": "<<ans+<<" "<<time+<<endl;

     }

     return ;

 }