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

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

const ll MOD = 1e9+7;

int main() {
  int t;
  cin >> t;
  rep(ti, t) {
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    rep(i,n-1) {
      a[i+1] = a[i]+a[i+1]+a[i]*a[i+1];
      a[i+1] %= MOD;
    }
    cout << a[n-1] << endl;



  }


}