#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 const ll MOD = 1000000007; int main() { int T; cin >> T; rep(_,T){ ll n; cin >> n; ll a[n] = {}; rep(i,n) cin >> a[i]; ll now = a[0]; srep(i,1,n){ now = now * a[i] + now + a[i]; now %= MOD; } cout << now << endl; } return 0; }