#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define fi first
#define se second

constexpr ll mod=1e9+7;

void solve(){
  int n;
  cin>>n;
  ll ans=1;
  for(int i=0;i<n;i++){
    ll a;
    cin>>a;
    ans*=(a+1);
    ans%=mod;
  }
  cout<<(mod+ans-1)%mod<<endl;
}

int main(){
  int t;
  cin>>t;
  while(t--){
    solve();
  }
}