#include<iostream>
#include<algorithm>
using namespace std;
bool v[30000000];
int n,k,a[100];
int ma,mi;
int main(){
int T,j,i,t=1,temp,sum,p,up;
cin>>T;
while(T--){
cin>>n>>k;
memset(v,0,sizeof(v));
ma = 0;
for(i=0;i<n;i++){
cin>>a[i];
ma+=a[i];
}
up = 1<<n;
for(i=1;i<up;i++){
temp = i;
p=0;
sum =0;
while(temp){
sum=sum+a[p++]*(temp&1);
temp>>=1;
}
v[sum] = 1;
}
mi = 1;
while(v[mi])mi++;
while(k--){
v[mi] = 1;
for(i=ma;i>=1;i--)
if(v[i]&&i!=mi)v[i+mi] =1;//注意这里需要有i!=mi
ma+=mi;
while(v[mi])mi++;
}
cout<<"Case "<<t++<<":\n"<<mi<<endl;
if(T)cout<<endl;
}
return 0;
}
