# include <bits/stdc++.h>
typedef long long int LL;
using namespace std;

# define abs(x) (((x)>0)?(x):-(x))

const LL N = 1e5+10;
const LL M = 10007;

/******************************************/
LL n,a[N],h[N],b[N];
LL k;

LL fac[M],inv[M];

LL qmod(LL a,LL b){
    LL res=1;
    while(b){
        if(b&1) res=res*a%M;
        b>>=1,a=a*a%M;
    }
    return res;
}

void init(){
    fac[0]=1;
    for(LL i=1;i<M;i++) fac[i]=fac[i-1]*i%M;
    inv[M-1]=qmod(fac[M-1],M-2);
    for(LL i=M-2;i>=0;i--) inv[i]=inv[i+1]*(i+1)%M;
}

LL C(LL n,LL m){
    return fac[n]*inv[m]%M*inv[n-m]%M;
}

LL Combination(LL n, LL m){
    if(n<m) return 0;
    if(n<M&&m<M) return C(n,m);
    return Combination(n/M,m/M)*Combination(n%M,m%M)%M;
}

int main(){
    init();
    LL _;scanf("%lld",&_);
    while(_--){
        scanf("%lld",&n);
        for(LL i=0;i<=n;i++) scanf("%lld",&a[i]),a[i]=a[i]%M;
        scanf("%lld",&k);
        for(LL i=0,j,x;i<=n;i++){
            for(h[i]=j=0,x=1;j<=n;j++){
                h[i]=(h[i]+a[j]*x%M)%M;
                h[i]=(h[i]%M+M)%M;x=x*i%M;
            }
        }

        b[0]=h[0];
        for(LL i=1;i<=n;i++){
            for(LL j=0;j<=n-i;j++)
                h[j]=(h[j+1]-h[j]+M)%M;
            b[i]=h[0];
        }
        
        LL ans = 0;
        for(LL i=0;i<=n;i++){
            ans = ans + b[i]*Combination(k,i+1)%M;
            ans = (ans%M+M)%M;
        }
        printf("%lld\n",ans);
    }
    return 0;
}