#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 15
using namespace std;
long long read()
{
    char c=0;
    long long sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
int T,n,Base;
const long long inf=(long long)(1e18);
long long a[N+1],F,ans;
vector<long long>p[N+1];
vector<long long>q[N+1];
void dfs(int x,int d,long long res)
{
    if (x==Base+1)
    {
	p[d].push_back(res);
	return;
    }
    if (x==1||d) dfs(x+1,d+1,res-(a[x]<<1));
    if (d) dfs(x+1,d,res),dfs(x+1,d-1,res+(a[x]<<1));
    return;
}
void dfs2(int x,int d,long long res)
{
    if (x==Base)
    {
	q[d].push_back(res);
	return;
    }
    if (x==n||d) dfs2(x-1,d+1,res+(a[x]<<1));
    if (d) dfs2(x-1,d,res),dfs2(x-1,d-1,res-(a[x]<<1));
    return;
}
int main()
{
    int ps;
    T=read();
    for (int qt=1;qt<=T;++qt)
    {
	n=read(),Base=n>>1,ans=-inf;
	for (int i=1;i<=n;++i) a[i]=read();
	F=read(),sort(a+1,a+n+1);
	for (int i=0;i<=Base;++i) p[i].clear(),q[i].clear();
	dfs(1,0,0),dfs2(n,0,0);
	for (int i=1;i<=Base;++i)
	{
	    sort(p[i].begin(),p[i].end()),sort(q[i].begin(),q[i].end()),ps=-1;
	    for (int j=(int)(q[i].size())-1;j>=0;--j)
	    {
		while (ps+1<p[i].size()&&p[i][ps+1]+q[i][j]<=F) ++ps;
		if (ps!=-1) ans=max(ans,p[i][ps]+q[i][j]);
	    }
	}
	if (ans==-inf) printf("Case #%d: NO SOLUTION\n",qt);
	else printf("Case #%d: %lld\n",qt,ans);
    }
    return 0;
}