B. Card Trick

#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define endl '\n'

using namespace std;

typedef long long ll;
typedef pair<int,int>PII;

const int N=200010;

int t,n,m;
int a[N],b[N];

void solve()
{
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	cin>>m;
	int sum=0;
	for(int i=0;i<m;i++)
	{
		cin>>b[i];
		sum=(sum+b[i])%n;
	}
	cout<<a[sum]<<endl;
	
}

int main()
{
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
 }