1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#include <bits/stdc++.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
 
#define PII pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<int>
 
#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; } 
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; } 
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}
 
#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue
 
#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
 
 
using namespace std;

const int max_n = 1e6 + 5;

int n;

vector<PII> odbijanki[40][2];
bitset<9000> halo[9000][2];
int dx[]={1,1,-1,-1};
int dy[]={1,-1,-1,1};

int inv0[] = {3, 2, 1, 0};
int inv1[] = {1, 0, 3, 2};

int posx = 1;
int posy = 0;
int POWER;
int kier = 0;

void nxt(int moves) {
	FOR(i,0,moves) {
		posx = posx + dx[kier];
		posy = posy + dy[kier];
		if (posx == 0 || posx == POWER ||  (posx%2==1 && halo[posx/2][0].test(posy/2))) {
			kier = inv0[kier];
			continue;
		}
		else if (posy == 0 || posy == POWER || (posy%2==1 && halo[posx/2][1].test(posy/2))) {
			kier = inv1[kier];
		}
	}
	return ;
}


int main() {
	read(n);
	odbijanki[1][0].pb(mp(1,2));
	odbijanki[1][1].pb(mp(2,3));
	odbijanki[1][0].pb(mp(3,2));
	POWER = (1<<(n+1));
	FOR(i,1,n) {
		int p2 = 1<<(i+1);
		odbijanki[i+1][0].pb(mp(1, p2));
		odbijanki[i+1][1].pb(mp(p2, p2 + 1));
		odbijanki[i+1][0].pb(mp(p2 + p2 - 1, p2));
		FORE(j, odbijanki[i][0]) {
			int x = j->st, y = j->nd;
			odbijanki[i+1][0].pb(mp(x, p2 + y));
			odbijanki[i+1][0].pb(mp(x+p2, y+p2));
			odbijanki[i+1][1].pb(mp(y, p2-x));
			odbijanki[i+1][1].pb(mp(p2+p2-y, x));
		}
		FORE(j, odbijanki[i][1]) {
			int x = j->st, y = j->nd;
			odbijanki[i+1][1].pb(mp(x, p2 + y));
			odbijanki[i+1][1].pb(mp(x+p2, y+p2));
			odbijanki[i+1][0].pb(mp(y, p2-x));
			odbijanki[i+1][0].pb(mp(p2+p2-y, x));
		}
	}
	FORE(i, odbijanki[n][0]) {
		int x = i->st, y = i->nd;
		halo[x/2][0].set(y/2);
	}
	FORE(i, odbijanki[n][1]) {
		int x = i->st, y = i->nd;
		halo[x/2][1].set(y/2);
	}
	
	make(z);
	int last = 0;
	while (z--) {
		make(a);
		int moves = a-last;
		last = a;
		nxt(moves);	
		printf("%d %d\n", posx, posy);
	}

}