#include <map>

#include <set>

#include <stack>

#include <cmath>

#include <queue>

#include <cstdio>

#include <vector>

#include <string>

#include <cstring>

#include <iterator>

#include <iostream>

#include <algorithm>

#define debug(a) cout << #a << " " << a << endl

using namespace std;

const int maxn = *1e5 + ;

const int mod = ;

typedef long long ll;

int main() {

    ios::sync_with_stdio(),cin.tie(),cout.tie();

    ll n;

    cin >> n;

    ll a[], b[];

    while( n -- ) {

        ll num;

        for( ll i = ; i <= ; i ++ ) {

            a[i] = b[i] = ;

        }

        a[] = ;

        for( ll i = ; i <= ; i ++ ) {

            ll num;

            cin >> num;

            if( num ==  ) {

                continue;

            }

            for( ll j = ; j <= ; j ++ ) {

                for( ll k = ; k <= num && k*i+j <= ; k ++ ) {

                    b[i*k+j] += a[j];

                }

            }

            for( ll j = ; j <= ; j ++ ) { //求出乘到现在为此出现的每项的系数

                a[j] = b[j];

                b[j] = ;

            }

        }

        ll total = ;

        for( ll i = ; i <= ; i ++ ) {

            total += a[i];

        }

        cout << total << endl;

    }

    return ;

}