// Duet of Dusk Embers--XrkArul
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ULL __int128_t
#define ull unsigned long long
#define vi vector<int>
#define vll vector<ll>
#define endl '\n'
#define ednl '\n'
#define pb push_back
#define fi first
#define se second
#define ls (p<<1)
#define rs (p<<1|1)
#define fix setprecision
#define all(v) (v).begin(),(v).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr<<#x<<':'<<' '<<x<<'\n'
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define pq priority_queue<int, vector<int>>
#define PQ priority_queue<int, vector<int>, greater<int>>
const ll inf = 1e18;
const ll mod=1e9+7;
const ull hashbase = 5767169;
ll powmod(ll a,ll b){ll s=1;a%=mod;while(b){if(b&1)s=s*a%mod;b>>=1;a=a*a%mod;}return s%mod;}

#define int long long
void solve(){
    
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T=1;
    //cin>>T;
    int n,m,q;
    while(cin>>m>>q){
        cin>>m>>q;
        int ff=1;
        for(int i=1;i<=m;i++)
            ff*=2;
        int f[ff+5]={0},g[ff+5]={0},h[ff+5]={0};
        for(int i=0;i<=ff-1;i++)
        {
            cin>>f[i];
        }
        for(int i=0;i<=ff-1;i++)
        {
            cin>>g[i];
        }
        for(int i=0;i<=ff-1;i++)
        {
            cin>>h[i];
        }
        while(q--)
        {
            int x,y,a,b;
            cin>>x>>y;
            a=y^g[x^f[y]];
            b=x^f[y]^h[a];
            cout<<a<<" "<<b<<endl;
        }
    }
    return 0;
}
/*

*/