// Memory   Time
// 1347K     0MS
// by : Snarl_jsb
// 2014-09-18-13.40
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<climits>
#include<cmath>
#define N 1000010
#define LL long long
using namespace std;

int cnt[100],c1[100],c2[100];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
//    freopen("C:\\Users\\ASUS\\Desktop\\cin.cpp","r",stdin);
//    freopen("C:\\Users\\ASUS\\Desktop\\cout.cpp","w",stdout);
    int Cas;
    cin>>Cas;
    while(Cas--)
    {
        for(int i=1;i<=26;++i)
            cin>>cnt[i];
        memset(c1,0,sizeof(c1));   //以防后面越界，最好全部赋值为0
        memset(c2,0,sizeof(c2));
        for(int i=0;i<=cnt[1]&&i<=50;++i)
            c1[i]=1;
        for(int i=2;i<=26;++i)
        {
            for(int j=0;j<=50;++j)
            {
                for(int k=0;k+j<=50&&k<=cnt[i]*i;k+=i)
                {
                    c2[k+j]+=c1[j];
                }
            }
            for(int j=0;j<=50;++j)
            {
                c1[j]=c2[j];
                c2[j]=0;
            }
        }
        long long ans=0;
        for(int i=1;i<=50 ;++i)
            ans+=c1[i];
        cout<<ans<<endl;
    }
    return 0;
}