#include "Anna.h"
#include <vector>
#include <cstdio>
#include <cassert>
namespace {
	const int N = 105, inf = 14;
	int a[N][N];
	// EWSN
	int get_direction(int sx, int sy, int tx, int ty)
	{
		if (tx > sx) return 0;
		if (tx < sx) return 1;
		if (ty > sy) return 2;
		if (ty < sy) return 3;
		return 0;
	}
} // namespace

//					Y			X
void Anna(int N, int K, std::vector<int> R, std::vector<int> C) 
{
	auto dist = [&](int a, int b)
	{
		int d = b - a;
		if (d < -2) return -2;
		if (d > 2) return 2;
		return d;
	};
	auto go = [&](int x, int y, int c)
	{
		if (x >= N || y >= N) return 1;
		if (c >= K) return 1;
		int dx = dist(x, R[c]), dy = dist(y, C[c]);
		if (dx == -2) return 1;
		if (dy == -2) return 2;
		if (dx == 2) return 3;
		if (dy == 2) return 4;
		return (dx + 1) * 3 + dy + 2 + 4;
	};
	for (int i = 0; i < (N + 2) / 3; ++i)
		for (int j = 0; j < (N + 2) / 3; ++j)
		{
			int x = i * 3, y = j * 3;
			a[x][y] = inf, a[x][y + 1] = 1, a[x][y + 2] = go(x, y + 2, 0);
			a[x + 1][y] = go(x + 1, y, 1), a[x + 1][y + 1] = go(x + 1, y + 1, 2), a[x + 1][y + 2] = go(x + 1, y + 2, 3);
			a[x + 2][y] = go(x + 2, y, 4), a[x + 2][y + 1] = go(x + 2, y + 1, 5), a[x + 2][y + 2] = go(x + 2, y + 2, 6);
		}
	for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j)
	{	
	 	SetFlag(i, j, a[i][j]);
	}
}

#include "Bruno.h"
#include <vector>
#include <cstdio>
#include <cassert>

namespace 
{
const int N = 105, inf = 14;
int sp[3][3], px, py;
int gtable[6][6] = 
{
	{ 8, 9, 0, 8, 9, 0 },
	{ 1, 2, 3, 1, 2, 3 },
	{ 4, 5, 6, 4, 5, 6 },
	{ 8, 9, 0, 8, 9, 0 },
	{ 1, 2, 3, 1, 2, 3 },
	{ 4, 5, 6, 4, 5, 6 }
};

int table[3][3][3][3];

void init()
{
	for (int i = 0; i < 3; ++i)
		for (int j = 0; j < 3; ++j)
		{
			for (int x = 0; x < 3; ++x)
				for (int y = 0; y < 3; ++y)
					table[i][j][x][y] = gtable[3 - i + x][3 - j + y];
		}
}

void get(int V, int &x, int &y)
{
	if (V == 1) x = -2, y = 1e9;
	else if (V == 2) y = -2, x = 1e9;
	else if (V == 3) x = 2, y = 1e9;
	else if (V == 4) y = 2, x = 1e9;
	else
	{
		V -= 5;
		y = V % 3; --y;
		x = V / 3; --x;
	}
	//--V;
	//y = V % 5; y -= 2;
	//x = V / 5; x -= 2;
}

// EWSN

int gao(int x, int y)
{
	if (!x && !y) return 4;
	if (x > 0 && x <= 10) return 2;
	if (x < 0) return 3;
	if (y > 0 && y <= 10) return 0;
	if (y < 0) return 1;
	throw;
}

} // namespace

/*
 * S F 0
 * 1 2 3
 * 4 5 6
 *
 * S F 0 S F 0
 * 1 2 3 1 2 3
 * 4 5 6 4 5 6
 * S F 0 S F 0
 * 1 2 3 1 2 3
 * 4 5 6 4 5 6
 */

std::vector<int> Bruno(int K, std::vector<int> value) 
{
	for (int i = 1; i <= 25; ++i)
	{
		int x, y; get(i, x, y);
	}
	init();
	sp[0][0] = value[0]; sp[0][1] = value[1]; sp[0][2] = value[2];
	sp[1][0] = value[3]; sp[1][1] = value[4]; sp[1][2] = value[5];
	sp[2][0] = value[6]; sp[2][1] = value[7]; sp[2][2] = value[8];
	for (int i = 0; i < 3; ++i)
		for (int j = 0; j < 3; ++j)
			if (sp[i][j] == inf)
			{
				px = i; py = j;
			}
	assert(px >= 0 && py >= 0);
	auto tb = table[px][py];
	std::vector<int> ans(K);
	for (int i = 0; i < 3; ++i)
		for (int j = 0; j < 3; ++j)
		{
			if (tb[i][j] < K)
			{
				int dx, dy; get(sp[i][j], dx, dy);
			       	dx += i - 1, dy += j - 1;
				ans[tb[i][j]] = gao(dx, dy);
			}
		}
	for (int i = 0; i < K; ++i)
	{
	}
	return ans;

}