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

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;
}

ll mx;
int T, n, k, sum;
vector<ll> vec[N];
bool tag = true;

namespace subtask1 {
	bool cnt[60], pd;
	
	bool check() {return k == 1;}
	
	void solve() {
		ll y, res;
		for (int qwq = 1; qwq <= T; ++qwq) {
			pd = false;
			for (int i = 0; i < 60; ++i) cnt[i] = 0;
			for (auto x : vec[qwq]) {
				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");
		}
	}
}

namespace subtask2 {
	const int M = (1 << 22) - 1;
	const int W = (1 << 22) + 3;
	
	int a[W];
	
	bool check() {return mx <= M;}
	
	void solve() {
		a[0] = 0; int lst = 0, x;
		for (int i = 1;; ++i) {
			x = 1;
			for (int j = 1; j <= k; ++j) x *= i;
			for (int j = lst + 1 ; j < x && j <= M; ++j) a[j] = a[j - i];
			if (x <= M) a[lst = x] = i;
			else break;
		}
		for (int i = 1; i <= M; ++i) a[i] ^= a[i - 1];
		int res;
		for (int qwq = 1; qwq <= T; ++qwq) {
			res = 0;
			for (auto x : vec[qwq]) res ^= a[x];
			puts(res ? "Lily" : "Kaguya");
		}
	}
}

namespace subtask3 {
	vector<ll> pw;
	map<ll, int> mp;
	
	bool check() {return tag && mx < (1ll << 32) && sum <= 1000;}
	
	int calc(ll x) {
		if (mp.count(x)) return mp[x];
		int pos = upper_bound(pw.begin(), pw.end(), x) - pw.begin() - 1;
		ll y = (x - pw[pos]) % (pos + 1) + pw[pos];
		if (y == pw[pos]) return pos;
		return mp[x] = calc(y - pos - 1);
	}
	
	void solve() {
		int res;
		for (int i = 0;; ++i) {
			ll x = 1;
			for (int j = 1; j <= k; ++j) x = min(x * i, mx + 1);
			if (x > mx) break;
			pw.push_back(x);
		}
		for (int qwq = 1; qwq <= T; ++qwq) {
			res = 0;
			for (int i = 1; i < vec[qwq].size(); i += 2) res ^= calc(vec[qwq][i]);
			puts(res ? "Lily" : "Kaguya");
		}
	}
}

int main() {
	T = read(); k = read(); ll x;
	for (int i = 1; i <= T; ++i) {
		n = read(); sum += n; tag &= (n % 2 == 0);
		while (n--) x = Read(), vec[i].push_back(x), mx = max(mx, x);
		if (tag) for (int j = 0; j < vec[i].size(); j += 2) tag &= (vec[i][j] + 1 == vec[i][j + 1]);
	}
	if (subtask1 :: check()) subtask1 :: solve();
	else if (subtask2 :: check()) subtask2 :: solve();
	else if (subtask3 :: check()) subtask3 :: solve();
	return 0;
}
/*
1 2
10
6 7 9 10 17 18 2 3 24 25 
*/