#include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector a(n); rep(i,0,n) cin >> a[i]; vector b(n); rep(i,0,n-1) cin >> b[i+1]; if (n == 1){ int q; cin >> q; while(q--){ ll t, r, c; cin >> t >> r >> c; cout << a[0] << '\n'; } return 0; } int rgt = 0; int dwn = 0; if (a[1] == b[1]){ rgt = 1; dwn = 1; rep(i,2,n){ if (i % 2 == 1){ if (a[i] != a[1]){ break; } rgt = i; }else{ if (a[i] == a[1]){ break; } rgt = i; } } rep(i,2,n){ if (i % 2 == 1){ if (b[i] != b[1]){ break; } dwn = i; }else{ if (b[i] == b[1]){ break; } dwn = i; } } } //cout << rgt << ' ' << dwn << endl; int q; cin >> q; while(q--){ ll t, r, c; cin >> t >> r >> c; r--; c--; if (r == 0){ cout << a[c] << '\n'; }else if (c == 0){ cout << b[r] << '\n'; }else if (c <= rgt && r <= dwn){ if (a[1] == 1){ if (r + c - 1 <= t){ cout << (r + c) % 2 << '\n'; }else{ cout << t % 2 << '\n'; } }else{ if (r + c <= t){ cout << (r + c + 1) % 2 << '\n'; }else{ cout << t % 2 << '\n'; } } }else{ cout << t % 2 << '\n'; } } }