#include "Anna.h"
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef array<int, 3> ai3;

namespace {

int n, k, a[111][111];
vi R, C;

bool relabel(int sx, int sy){
	//cout << "relab " << sx << " " << sy << endl;
	for(int i = sx; i < n; i += 3) for(int j = sy; j < n; j += 3){
		//cout << i << " " << j << endl;
		if(i >= 0 && j >= 0) a[i][j] = 1;
		a[i+2][j+2] = 114514;
		int id = 0;
		for(int dx = 0; dx < 3; ++dx) for(int dy = 0; dy < 3; ++dy){
			if((dx == 0 && dy == 0) || (dx == 2 && dy == 2) || id >= k) continue;
			int x = i + dx, y = j + dy;
			if(x >= 0 && y >= 0){
				if(abs(R[id] - x) <= 1 && abs(C[id] - y) <= 1){
					a[x][y] = (R[id] - x + 1) * 3 + (C[id] - y + 1) + 6;
				} else {
					if(C[id] > y+1) a[x][y] = 2;
					else if(C[id] < y-1) a[x][y] = 3;
					else if(R[id] > x+1) a[x][y] = 4;
					else a[x][y] = 5;
				}
			}
			++id;
		}
	}
	static bool has[16];
	memset(has, 0, sizeof(has));
	rep(i, n) rep(j, n) if(a[i][j] <= 14) has[a[i][j]] = 1;
	if(has[14]) return 0;
	int no = -1;
	for(int i = 6; i <= 13; ++i) if(!has[i]) no = i;
	rep(i, n) rep(j, n){
		if(a[i][j] == 114514) a[i][j] = (no == 13 ? 2 : no);
		else if(a[i][j] > no) --a[i][j];
	}
	return 1;
}

}


void Anna(int N, int K, vi R, vi C){
	n = N, k = K;
	::R = R, ::C = C;

	for(int x = 0; x >= -2; --x) for(int y = 0; y >= -2; --y)
		if(relabel(x, y)){
			//rep(i, n){
			//	rep(j, n) cout << a[i][j] << " ";
			//	cout << "\n";
			//}
			rep(i, n) rep(j, n) SetFlag(i, j, a[i][j]);
			return ;
		}
}

#include "Bruno.h"
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef array<int, 3> ai3;

namespace {

int val[3][3];

}

vi Bruno(int K, vi value){
	rep(i, 3) rep(j, 3) val[i][j] = value[i*3 + j];

	int sx = -1, sy = 3;
	while(sy == 3){ ++sx, sy = 0; while(sy < 3 && val[sx][sy] != 1) ++sy; }
	int no = val[(sx + 2) % 3][(sy + 2) % 3];

	vi ans;
	int nx = sx, ny = sy;
	rep(id, K){
		ny = (ny + 1) % 3; nx = (nx + (ny == sy)) % 3;
		//cout << id << ": " << val[nx][ny] << "\n";
		if(val[nx][ny] <= 5) ans.emplace_back(val[nx][ny] - 2);
		else {
			if(no != 2) val[nx][ny] += (val[nx][ny] >= no);
			int tx = nx + (val[nx][ny] - 6) / 3 - 2, ty = ny + (val[nx][ny] - 6) % 3 - 2;
			//cout << " " << tx << " " << ty << "\n";
			if(ty > 0) ans.emplace_back(0);
			else if(ty < 0) ans.emplace_back(1);
			else if(tx > 0) ans.emplace_back(2);
			else if(tx < 0) ans.emplace_back(3);
			else ans.emplace_back(4);
		}
	}

	return ans;
}