#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 43;
const int COPIES = 3;

namespace {

int possget(int a,int b){
	int curr = 0;
	for(int i=0;i<4;i++){
		for(int j=0;j<4;j++){
			if(i==a and j==b)return curr;
			curr++;
		}
	}
}

vector<vector<pair<int,int>>> alignment = {
	{{0,0},{1,1},{2,2}},
	{{0,7},{1,6},{2,5}},
	{{5,5},{6,6},{7,7}},
	{{7,0},{6,1},{5,2}},
};
vector<pair<int,int>> readr = {
	{2,0},
	{2,6},
	{4,6},
	{4,0},
};

}

void Anna(int X, int Y, int N, string S) {
	int currpos = possget(X%4,Y%4);
	int currbest = -1;
	vector<vector<bool>> skip(8,vector<bool>(8));
	for(int i=0;i<8;i++)skip[i][Y]=skip[X][i]=true;
	if(X>=4 and Y>=4)currbest=0;
	else if(X>=4 and Y<4)currbest=1;
	else if(X<4 and Y<4)currbest=2;
	else if(X<4 and Y>=4)currbest=3;
	for(int i=0;i<4;i++){
		if(i==currbest){
			Paint(alignment[i][0].first,alignment[i][0].second,1);
			skip[alignment[i][0].first][alignment[i][0].second]=true;
			Paint(alignment[i][1].first,alignment[i][1].second,1);
			skip[alignment[i][1].first][alignment[i][1].second]=true;
			Paint(alignment[i][2].first,alignment[i][2].second,1);
			skip[alignment[i][2].first][alignment[i][2].second]=true;
			Paint(readr[i].first,readr[i].second,min(1,currpos&(1<<0)));
			skip[readr[i].first][readr[i].second]=true;
			Paint(readr[i].first,readr[i].second+1,min(1,currpos&(1<<1)));
			skip[readr[i].first][readr[i].second+1]=true;
			Paint(readr[i].first+1,readr[i].second,min(1,currpos&(1<<2)));
			skip[readr[i].first+1][readr[i].second]=true;
			Paint(readr[i].first+1,readr[i].second+1,min(1,currpos&(1<<3)));
			skip[readr[i].first+1][readr[i].second+1]=true;
		} else {
			for(int j=0;j<3;j++){
				if(!skip[alignment[i][j].first][alignment[i][j].second]){
					skip[alignment[i][j].first][alignment[i][j].second]=true;
					Paint(alignment[i][j].first,alignment[i][j].second,0);
					break;
				}
			}
		}
	}
	long long num_to_write = 0;
	for(int i=0;i<S.size();i++)if(S[i]=='B')num_to_write|=(1ll<<i);
	int bit = 0;
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			if(skip[i][j])continue;
			Paint(i,j,min(1ll,num_to_write&(1ll<<bit)));
			bit++;
		}
	}
}

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 43;
const int COPIES = 3;

namespace {

pair<int,int> possget(int x){
	int curr = 0;
	for(int i=0;i<4;i++){
		for(int j=0;j<4;j++){
			if(curr++==x)return {i,j};
		}
	}
}

vector<vector<pair<int,int>>> alignment = {
	{{0,0},{1,1},{2,2}},
	{{0,7},{1,6},{2,5}},
	{{5,5},{6,6},{7,7}},
	{{7,0},{6,1},{5,2}},
};

vector<pair<int,int>> readr = {
	{2,0},
	{2,6},
	{4,6},
	{4,0},
};

}

string Bruno(int N, vector<vector<int>> T) {
	int currbest = -1;
	for(int i=0;i<4;i++){
		bool works = true;
		for(int j=0;j<3;j++){
			if(T[alignment[i][j].first][alignment[i][j].second]==0)works=false;
		}
		if(works)currbest=i;
	}
	int currpos = 0;
	currpos|=(T[readr[currbest].first][readr[currbest].second]<<0);
	currpos|=(T[readr[currbest].first][readr[currbest].second+1]<<1);
	currpos|=(T[readr[currbest].first+1][readr[currbest].second]<<2);
	currpos|=(T[readr[currbest].first+1][readr[currbest].second+1]<<3);
	auto [X,Y] = possget(currpos);
	if(currbest==0){X+=4;Y+=4;}
	else if(currbest==1)X+=4;
	else if(currbest==3)Y+=4;
	vector<vector<bool>> skip(8,vector<bool>(8));
	for(int i=0;i<8;i++)skip[i][Y]=skip[X][i]=true;
	for(int i=0;i<4;i++){
		if(i==currbest){
			skip[alignment[i][0].first][alignment[i][0].second]=true;
			skip[alignment[i][1].first][alignment[i][1].second]=true;
			skip[alignment[i][2].first][alignment[i][2].second]=true;
			skip[readr[i].first][readr[i].second]=true;
			skip[readr[i].first][readr[i].second+1]=true;
			skip[readr[i].first+1][readr[i].second]=true;
			skip[readr[i].first+1][readr[i].second+1]=true;
		} else {
			for(int j=0;j<3;j++){
				if(!skip[alignment[i][j].first][alignment[i][j].second]){
					skip[alignment[i][j].first][alignment[i][j].second]=true;
					break;
				}
			}
		}
	}
	string ans;
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			if(skip[i][j])continue;
			if(ans.size()==N)break;
			if(T[i][j])ans.insert(ans.end(),'B');
			else ans.insert(ans.end(),'A');
		}
	}
	return ans;
}