tmp

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>

#include <algorithm>
#include <iostream>
#include <limits>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long ll;

const int N = 1010;

int n, m;
int a[N][N];
int x[N], y[N];


int main() {
#ifdef LBT
	freopen("test.in", "r", stdin);
	int nol_cl = clock();
#endif

	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j)
			scanf("%d", &a[i][j]);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j) {
			int x;
			scanf("%d", &x);
			a[i][j] ^= x;
		}
	// a[i][j] = x[i] ^ y[j]
	for (int j = 1; j <= m; ++j)
		y[j] = a[1][j];
	for (int i = 2; i <= n; ++i)
		x[i] = a[i][1] ^ y[1];
	for (int i = 2; i <= n; ++i)
		for (int j = 2; j <= m; ++j)
			if ((x[i] ^ y[j]) != a[i][j]) {
				puts("Budexing");
				return 0;
			}
	puts("Koyi");

#ifdef LBT
	LOG("%dms\n", (clock() - nol_cl) * 1000 / CLOCKS_PER_SEC);
#endif
	return 0;
}