#include "Anna.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
#define rep(a, b) for(int a = 0; a < (b); ++a)
namespace {
	vector<int>Encode(string p) {
		ll x=0, mask=0;
		rep(i, p.size()) if(p[i]=='B') x+=1ll<<(ll)i;
		while(true) {
			if(__builtin_popcountll(mask)<=5) {
				if(!x) break;
				--x;
			}
			++mask;
		}
		vector<int>ans(7);
		rep(i, 7) if(mask&(1<<i)) ans[i]=1;
		return ans;
	}
}

void Anna(int X, int Y, int N, string S) {
	while(S.size()<30) S+="A";
	int p=-1;
	rep(i, 8) if(i!=X && i/2==X/2) {
		p=i/2;
		rep(j, 8) if(j!=Y) Paint(i, j, 1);
	}
	int q=0;
	if(!p) q=2;
	vector<int>xd(8);
	if(Y==0) xd={0, 0, 0, 0, 0, 0, 0, 1};
	else if(Y==1) xd={0, 0, 0, 1, 0, 0, 1, 0};
	else if(Y==6) xd={0, 0, 1, 0, 0, 0, 0, 1};
	else if(Y==7) xd={0, 0, 1, 1, 0, 0, 1, 0};
	else if(Y==2) xd={0, 0, 0, 0, 0, 0, 0, 0};
	else if(Y==3) xd={0, 1, 0, 0, 0, 0, 0, 1};
	else if(Y==4) xd={1, 0, 0, 0, 0, 0, 1, 0};
	else if(Y==5) xd={1, 1, 0, 0, 0, 0, 1, 1};
	rep(i, 8) if(i!=Y) Paint(q, i, xd[i]);
	int akt=0;
	rep(i, 8) if(i/2!=p && i!=q) {
		string tmp="";
		rep(j, 6) {
			tmp+=S[akt];
			++akt;
		}
		vector<int>V=Encode(tmp);
		int ile=0;
		rep(j, 8) if(j!=Y) {
			Paint(i, j, V[ile]);
			++ile;
		}
	}
}

#include "Bruno.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
namespace {
	string Decode(vector<int>V) {
		ll mask=0;
		rep(i, V.size()) mask+=(1ll<<(ll)i)*V[i];
		ll x=0;
		rep(i, mask) if(__builtin_popcountll(i)<=5) ++x;
		string ans="";
		rep(i, 6) if(x&(1ll<<(ll)i)) ans+="B"; else ans+="A";
		return ans;
	}
}
string Bruno(int N, vector<vector<int>>T) {
	int p=-1;
	rep(i, 8) {
		int sum=0;
		rep(j, 8) sum+=T[i][j];
		if(sum>=7) p=i/2;
	}
	int q=0;
	if(!p) q=2;
	int Y=0;
	if(T[q][0]==T[q][6] && T[q][1]==T[q][7]) {
		Y=2;
		if(T[q][1]) ++Y;
		if(T[q][0]) Y+=2;
	} else {
		if(T[q][2] && T[q][3]) Y=7;
		else if(T[q][2] && !T[q][3]) Y=6;
		else if(!T[q][2] && T[q][3]) Y=1;
		else Y=0;
	}
	string ans="";
	rep(i, 8) if(i/2!=p && i!=q) {
		vector<int>tmp;
		rep(j, 8) if(j!=Y) tmp.pb(T[i][j]);
		ans+=Decode(tmp);
	}
	while(ans.size()>N) ans.pop_back();
	return ans;
}