#include<iostream>
#include<cstdio>
#define maxn 1000000
using namespace std;
long long f[maxn], g[maxn], c, a[maxn];
const long long mod = 9999997;
int b[maxn];
int main() {
	freopen("Marshtomp.in", "r", stdin);
	freopen("Marshtomp.out", "w", stdout);
    int n, m;
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i]; 
    cin >> m;
    for(int i = 0; i < m; i++) {
	    cin >> c;
	    b[c] = 1;
	}
	int j = 1;
    for(int i = 1; i <= n; i++) {
        f[i] = (f[i-1]*a[i]+a[i]+f[i-1]+mod)%mod;
		if(b[i]) {
		    f[i] = (f[i]-g[j]*a[i]+mod)%mod;
            j++;
		    g[j] = (g[j-1]+f[i]-f[i-1]+mod)%mod;
		} else g[j] = (g[j]+g[j]*a[i]+mod)%mod;
    }
    cout << (f[n]+mod)%mod;
return 0;
}