#include <iostream>
#include <bits/stdc++.h>

using namespace std;
const int maxn = 100000+10;
int dp[maxn];
int v[maxn];
int cnt[maxn];
int main()
{
    int t;
    cin >> t;
    int kase = 0;
    while(t--)
    {
        int n,w;
        cin >> n >> w;
        for(int i = 1 ; i <= n ; i ++)
            cin >> v[i];
        printf("Case %d:",++kase);
        memset(dp,0,sizeof(dp));
        memset(cnt,0,sizeof(cnt));
        for(int i = 1 ; i <= n ; i++)
        {
            for(int j = w-1 ; j >= v[i] ; j--)
            {
                if(cnt[j] < cnt[j - v[i]]+1)
                {
                   dp[j] = dp[j-v[i]]+v[i];
                   cnt[j] = cnt[j-v[i]]+1;                 
                }
                else if(cnt[j] == cnt[j-v[i]]+1)
                    dp[j] = max(dp[j],dp[j-v[i]]+v[i]);
            }
        }
        cout << " " << cnt[w-1]+1 << " " << dp[w-1]+678 << endl;
    }
    return 0;
}