#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
using namespace std ;
typedef long long ll;
#define mod 1000000007
#define inf 100000
inline ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
    return x*f;
}
//******************************************************************
int T,n,a[2005];
int dp[2005][2005];
int main()
{
    scanf("%d",&T);
        while(T--){
            scanf("%d",&n);
            int  sum=0;
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a[i]);
                sum+=a[i];
            }
            memset(dp,0,sizeof(dp));
            for(int i=0;i<=a[1];i++)
            {
                dp[1][i]=1;
            }
            for(int i=2;i<=n;i++)
            {
                for(int j=0;j<=sum;j++)
                {
                    for(int k=0;k<=a[i]&&j+k<=sum;k++)
                    {
                        dp[i][j+k]=(dp[i][j+k]+dp[i-1][j])%mod;
                    }
                }
            }
            cout<<dp[n][sum/2]<<endl;
        }
    return 0;
}