#include "Anna.h"
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif

void Anna(int X, int Y, int N, string S) {
	debug("Anna");
	debug(X, Y, N, S.data());
	auto gen_val = [&](int m, int num) {
		mt19937_64 rng(8928311);
		auto rd = [&](LL l, LL r) {
			return LL(rng() % (r - l + 1) + l);
		};
		debug(m, num);
		set<LL> used;
		LL g;
		while (ssize(used) < num) {
			g = rd(0, 1ll << m);
			used.emplace(g);
			debug(g);
		}
		debug(used);
		return g;
	};

	const int n = 8;
	int poz = 0;
	vector<pair<int, int>> inds;
	vector pla(n, vector(n, 0));
	REP (i, n)
		REP (j, n)
			if (i != X && j != Y) {
				if (poz < N) {
					Paint(i, j, S[poz] - 'A');
					pla[i][j] = S[poz] - 'A';
				}
				else {
					inds.emplace_back(i, j);
				}
				++poz;
			}

	int m = ssize(inds);
	int num = X * n + Y + 1;

	LL g = gen_val(m, num);
	for (auto [x, y] : inds) {
		Paint(x, y, g & 1);
		pla[x][y] = g & 1;
		g >>= 1;
	}
	REP (i, n)
		debug(pla[i]);
}

#include "Bruno.h"
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif

string Bruno(int N, vector<vector<int>> T) {
	debug("Bruno");
	debug(N);
	REP (i, 8)
		debug(T[i]);
	auto gen_val = [&](int m, int num) {
		mt19937_64 rng(8928311);
		auto rd = [&](LL l, LL r) {
			return LL(rng() % (r - l + 1) + l);
		};
		debug(m, num);
		set<LL> used;
		LL g;
		while (ssize(used) < num) {
			g = rd(0, 1ll << m);
			used.emplace(g);
			debug(g);
		}
		debug(used);
		return g;
	};

	const int n = 8;
	auto makes_sense = [&](vector<int> t, int X, int Y) {
		debug("makes_sense", X, Y, t);
		LL g = gen_val(49 - N, X * n + Y + 1);
		FOR (i, N, 48) {
			debug(i, t[i], g & 1);
			if (t[i] != (g & 1))
				return false;
			g >>= 1;
		}
		return true;
	};

	auto decode = [&](vector<int> t) {
		string ret;
		REP (i, N)
			ret += 'A' + t[i];
		return ret;
	};

	REP (X, n) {
		REP (Y, n) {
			vector<int> t;
			REP (i, n)
				REP (j, n)
					if (i != X && j != Y)
						t.emplace_back(T[i][j]);
			if (makes_sense(t, X, Y))
				return decode(t);
		}
	}
	assert(false);
	return "XD";
}