#include<bits/stdc++.h>
using namespace std;
const int maxn = 55;
const int maxt = maxn*180+678;
int dp[maxt],song[maxn],Case=0,n,t;
int main() {
//freopen("in.txt","r",stdin);
int cc;
scanf("%d",&cc);
while(cc--) {
scanf("%d%d",&n,&t);
memset(dp,-0x3f,sizeof(dp));
for(int i=1;i<=n;i++) scanf("%d",&song[i]);
dp[0]=0;
for(int i=1;i<=n;i++) {
for(int j=t-1;j>=song[i];j--) dp[j]=max(dp[j],dp[j-song[i]]+1);
}
int ans=t-1;
for(int i=t-1;i>=0;i--) if(dp[i]>dp[ans]) ans=i;
printf("Case %d: %d %d
",++Case,dp[ans]+1,ans+678);
}
return 0;
}