#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 3;

inline int read() {
	char ch = getchar(); int x = 0;
	while (!isdigit(ch)) {ch = getchar();}
	while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
	return x;
}

inline ll Read() {
	char ch = getchar(); ll x = 0;
	while (!isdigit(ch)) {ch = getchar();}
	while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
	return x;
}

int T, n, k;

namespace subtask1 {
	bool cnt[60], pd;
	
	void solve() {
		ll x, y, res;
		while (T--) {
			n = read(); pd = false;
			for (int i = 0; i < 60; ++i) cnt[i] = 0;
			for (int i = 1; i <= n; ++i) {
				x = Read();
				for (int j = 0; j < 60; ++j) {
					y = (1ll << j);
					res = (x / (y << 1)) * y;
					if ((x >> j) & 1ll) res += (x & (y - 1)) + 1;
					if (res & 1) cnt[j] ^= 1;
				}
			}
			for (int i = 0; i < 60; ++i) pd |= cnt[i];
			puts(pd ? "Lily" : "Kaguya");
		}
	}
}

int main() {
	T = read(); k = read();
	if (k == 1) subtask1 :: solve();
	return 0;
}