for t in range(int(input())):
n=int(input())
a=list(map(int, input().split()))
m=int(input())
print(a[sum(map(int, input().split()))%n])
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define sort(v) sort(v.begin(),v.end())
#define ll long long
ll mod=1e9+7;
ll power(ll a,ll b){
if(a==0)return 1;
ll ans=power(a/2,b);
ans*=ans;
ans%=mod;
if(a%2)ans*=b;
ans%=mod;
return ans;
}
ll mul(ll a,ll b){
return ((a%mod)*(b%mod))%mod;
}
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<ll> v(n);
for(int i=0;i<n;i++)cin>>v[i];
int m;
ll s=0;
cin>>m;
for(int i=0;i<m;i++){
ll x;
cin>>x;
s+=x;
}
s=s%n;
cout<<v[s]<<endl;
}
return 0;
}
1676D - X-Sum | 1679A - AvtoBus |
1549A - Gregor and Cryptography | 918C - The Monster |
4B - Before an Exam | 545B - Equidistant String |
1244C - The Football Season | 1696B - NIT Destroys the Universe |
1674A - Number Transformation | 1244E - Minimizing Difference |
1688A - Cirno's Perfect Bitmasks Classroom | 219A - k-String |
952A - Quirky Quantifiers | 451B - Sort the Array |
1505H - L BREAK into program | 171E - MYSTERIOUS LANGUAGE |
630D - Hexagons | 1690D - Black and White Stripe |
1688D - The Enchanted Forest | 1674C - Infinite Replacement |
712A - Memory and Crow | 1676C - Most Similar Words |
1681A - Game with Cards | 151C - Win or Freeze |
1585A - Life of a Flower | 1662A - Organizing SWERC |
466C - Number of Ways | 1146A - Love "A" |
1618D - Array and Operations | 1255A - Changing Volume |