// breitensuche
#include <cstdio>
#include <unistd.h>
#include <set>
#include <algorithm>
#include <queue>
#include <utility>

using namespace std;

int dists[10];
typedef set<int> tSI;
typedef queue<tSI> tQSI;
int used[10];
int kase,n;

int main()
{
        close(0);
        fopen("european.in","r");
        int k=0;
        scanf("%d",&kase);
        while(kase--)
        {
                scanf("%d",&n);
                for(int i=0; i<n; ++i) 
                    scanf("%d",&dists[i]);
//                sort(dists,dists+n);
                tSI s;
                s.insert(0);
                tQSI q;
                q.push(s);
                tSI result;
                while(1)
                {
                    
                    tSI qs = q.front();
//printf("qs.size()=%d\n",qs.size()) ;                   
                    q.pop();
                    int ok=1;
                    if(qs.size()>1)
                    for(int i1=0; i1<n; ++i1)
                    {
                        int found=0;
                        for(tSI::iterator it=qs.begin();it!=qs.end() && !found;++it)
                        {
                            for(tSI::iterator it2=qs.begin();*it2<*it && !found;++it2)
                            {
                                if(*it-*it2==dists[i1])
                                    found=1;
                            }
                        }
                        if(!found)
                            ok=0;
                    }
                    if(ok && qs.size()>1)
                    {
                        result = qs;
                        break;
                    }
                    for(tSI::iterator it=qs.begin();it!=qs.end();++it)
                    {
                        for(int i=0;i<n;++i)
                        {
                            tSI temp = tSI(qs);
                            if( temp.find(*it+dists[i])==temp.end() )
                            {
                                temp.insert(*it+dists[i]);
                                q.push(temp);
                            }
                            tSI temp2 = tSI(qs);
                            if( *it-dists[i]>0 && temp2.find(*it-dists[i])==temp2.end())
                            {
                                temp2.insert(*it-dists[i]);
                                q.push(temp2);
                            }
                        }
                    }
                    
                }
                printf("Scenario #%d\n",++k);
                printf("%d: ",result.size());
                for(tSI::iterator it=result.begin();it!=result.end();++it)
                {
                    if(it!=result.begin())
                        putchar(' ');
                    printf("%d",*it);
                }
                puts("\n");
                
        }
}