#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using lint = long long;
#define endl '\n'
lint const mod = 1e9+7;
//long const mod = 998244353;

lint inv_mod(lint x, lint p){
    lint ans = 1;
    lint tmp = x;
    for(lint i=1;i<=(p-2);i *= 2){
        if(i & (p-2)){
            ans *= tmp;
        }
        ans %= p;
        tmp = tmp*tmp;
        tmp %= p;
    }

    return ans;
}

void solve(){
    int n;
    cin >> n;
    int a[n];
    lint ans = 1;
    for(int i=0;i<n;i++){
        cin >> a[i];
        ans *= a[i];
        ans %= mod;
    }

    ans--;
    if(ans < 0)ans+=mod;
    cout << ans << endl;
    

}
int main(){
    int t;
    cin >> t;
    for(int i=0;i<t;i++){
        solve();
    }
}