#include <bits/stdc++.h>
using namespace std;
int dp[55][10005], num[55][10005], a[55];
int main()
{
std::ios::sync_with_stdio(0);
int n, m, t, cas, i, j, k, T;
scanf("%d", &T);
for(cas = 1; cas <= T; cas++)
{
scanf("%d %d", &n, &t);
t--;
memset(dp, 0, sizeof(dp));
memset(num, 0, sizeof(num));
int sum = 0;
for(i = 1; i <= n; i++){scanf("%d", &a[i]);sum += a[i];}
t = min(t, sum);
for(i = 1; i <= n; i++)
{
for(j = 0; j <= t; j++)
{
if(j >= a[i])
{
dp[i][j] = dp[i - 1][j]; num[i][j] = num[i - 1][j];
if(num[i - 1][j - a[i]] + 1 > num[i][j] || (num[i - 1][j - a[i]] + 1 == num[i][j] && dp[i - 1][j - a[i]] + a[i] > dp[i][j]))
{
num[i][j] = num[i - 1][j - a[i]] + 1;
dp[i][j] = dp[i - 1][j - a[i]] + a[i];
}
}
else
{
dp[i][j] = dp[i - 1][j];
num[i][j] = num[i - 1][j];
}
}
}
printf("Case %d: %d %d\n", cas, num[n][t] + 1, dp[n][t] + 678);
}
return 0;
}