Problem Link : https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2895

/*
     If opportunity doesn't knock, build a door.

            +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
            |S|.|S|.|R|.|A|.|S|.|A|.|M|.|K|
            +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

    Success is how high you bounce when you hit bottom.
*/


#include <bits/stdc++.h>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
int Set(int N,int pos){return N=N | (1<<pos);}
int reset(int N,int pos){return N= N & ~(1<<pos);}
bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

int n;
ll dp[18][(1<<17)+100];
int ara[18][18];
int temp[18];

ll func(int idx, int mask)
{
    if(__builtin_popcount(mask)==n) return 1;

    ll &ret=dp[idx][mask];

    if(ret!=-1) return ret;

    ll p=0;

    for(int i=0; i<n; i++)
    {
        if(!check(mask,i))
        {
            if(ara[idx][i] || ara[0][i] || temp[i])
            {
                vector<int>v;
                loop(j,n)
                {
                    if(temp[j]==0 && ara[idx][j])
                    {
                        temp[j]=1;
                        v.pb(j);
                    }
                }
                p+=func(i+1,Set(mask,i));
                loop(j,SZ(v)) temp[v[j]]=0;
            }
        }
    }

    return ret=p;

}



int main()
{
    CIN;
//    freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    int t;
    cin>>t;
    TEST_CASE(t)
    {
        cin>>n;
        loop(i,n+1)
        {
            string str;
            cin>>str;
            loop(j,n) ara[i][j]=(str[j]=='1');
        }

        ms(dp,-1);
        CASE_PRINT;
        cout<<func(0,0)<<endl;

    }

    return 0;
}

/*
User ID: turing_13
Problem Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=565
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

int Set(int n,int pos)  { return n = n | 1<<pos;}
bool check(int n,int pos) { return n & 1<<pos;}
int Reset(int n, int pos) { return n=n & ~(1<<pos);}

int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    int n,song[100],dp[25][MAX],bitmask[25][MAX];
    while(cin>>n)
    {
        int m;
        cin>>m;
        for(int i=1; i<=m; i++)
            cin>>song[i];
        for(int i=0; i<=m; i++)
            dp[i][0]=bitmask[i][0]=0;
        for(int i=0; i<=n; i++)
            dp[0][i]=bitmask[0][i]=0;
        for(int i=1; i<=m; i++)
            for(int j=1; j<=n; j++)
            {
                if(song[i]>j)
                {
                    dp[i][j]=dp[i-1][j];
                    bitmask[i][j]=bitmask[i-1][j];
                }
                else
                {
                    if(dp[i-1][j]>dp[i-1][j-song[i]]+song[i])
                        dp[i][j]=dp[i-1][j],bitmask[i][j]=bitmask[i-1][j];
                    else
                    {
                        dp[i][j]=dp[i-1][j-song[i]]+song[i];
                        bitmask[i][j]=Set(bitmask[i-1][j-song[i]],i);
                    }
                }
            }
            for(int i=1;i<=m;i++)
                if(check(bitmask[m][n],i))
                    cout<<song[i]<<" ";
            cout<<"sum:"<<dp[m][n]<<endl;
    }
    return 0;
}