#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 check() {return k == 1;}
	
	void solve() {
		ll res;
		for (int qwq = 1; qwq <= T; ++qwq) {
			res = 0;
			for (auto x : vec[qwq]) {
				if (x % 2 == 0) {
					res ^= x;
					if (x % 4) res ^= 1;
				}
				else if ((x + 1) % 4) res ^= 1;
			}
			puts(res ? "Lily" : "Kaguya");
		}
	}
}

namespace subtask2 {
	const int M = (1 << 22) - 1;
	const int W = (1 << 22) + 3;
	
	int a[W];
	
	inline bool check() {return mx <= M;}
	
	inline 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 {
	const int M = (1 << 18) - 1;
	const int W = (1 << 18) + 3;
	
	vector<ll> pw;
	int a[W];
	
	inline bool check() {return tag && mx < (1ll << 32) && sum <= 1000;}
	
	inline int calc(ll x) {
		if (x <= M) return a[x];
		if (x == 2) {
			int pos = sqrt(x); ll y = 1ll * pos * pos;
			if (x == y) return pos;
			else return calc((x - y) % (pos + 1) + y);
		}
		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 calc(y - pos - 1);
	}
	
	void solve() {
		a[0] = 0; int lst = 0;
		for (int i = 1, x;; ++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;
		}
		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");
		}
	}
}

namespace subtask4 {
	inline bool check() {return k == 2 && tag;}
	
	int work(int x, int y) {
		if (x & 1) return work(y - x / 2 - 1, y - x / 2 - 1);
		else return y - x / 2;
	}
	
	inline int calc(ll x) {
		int pos = sqrt(x);
		while (1ll * pos * pos > x) pos--;
		while (1ll * (pos + 1) * (pos + 1) <= x) pos++;
		x = (x - 1ll * pos * pos) % (pos + 1);
		return work(x, pos);
	}
	
	void solve() {
		int res = 0;
		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");
		}
	}
}

namespace subtask5 {
	vector<ll> pw;
	
	inline bool check() {return k == 3 && tag;}
	
	inline int calc(ll x) {
		int pos = upper_bound(pw.begin(), pw.end(), x) - pw.begin() - 1;
		return (x - pw[pos] + pos) % (pos + 1);
	}
	
	void solve() {
		pw.push_back(0);
		for (int i = 1;; ++i) {
			ll x = 1;
			for (int j = 1; j <= k; ++j) {
				if ((mx + 1) / i <= x) x = mx + 1;
				else x *= i;
			}
			if (x > mx) break;
			pw.push_back(x);
		}
		int res = 0;
		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");
		}
	}
}

namespace subtask6 {
	inline bool check() {return !(k & 1);}
	int work(int x, int y) {
		if (x & 1) return work(y - x / 2 - 1, y - x / 2 - 1);
		else return y - x / 2;
	}
	inline int get_pos(ll x) {
		int pos = pow(x, 1.0 / k);
		while (1ll * pos * pos > x) pos--;
		while (1ll * (pos + 1) * (pos + 1) <= x) pos++;
		return pos;
	}
	inline int sum(int x) {
		if ((x & 3) == 0) return x;
		else if ((x & 3) == 2) return x ^ 1;
		else if ((x & 3) == 1) return 1;
		else return 0;
	}
	inline int calc(int x) {
		if (x <= 0) return 0;
		if (x & 1) return calc(x + 1) ^ ((x + 1) / 2);
		return sum(x / 2) ^ calc(x / 2 - 1);
	}
	
	void solve() {
		int res;
		for (int qwq = 1; qwq <= T; ++qwq) {
			res = 0;
			for (auto x : vec[qwq]) {
				if (x == 0) continue;
				int pos = get_pos(x);
				res ^= calc(pos - 1);
				ll y = 1ll * pos * pos;
				ll z = x - y;
				z %= ((pos + 1) << 1);
				x = y + z;
				if (x - y <= pos) res ^= calc(pos + pos) ^ calc(pos + pos - (x - y) - 1);
				else res ^= calc(pos + pos - (x - y - pos)) ^ calc(pos - 1);
			}
			puts(res ? "Lily" : "Kaguya");
		}
	}
}

namespace subtask7 {
	vector<ll> pw;
	
	inline bool check() {return k & 1;}
	inline int get_pos(ll x) {
		int pos = upper_bound(pw.begin(), pw.end(), x) - pw.begin() - 1;
		return pos;
	}
	inline int sum(int x) {
		if ((x & 3) == 0) return x;
		else if ((x & 3) == 2) return x ^ 1;
		else if ((x & 3) == 1) return 1;
		else return 0;
	}
	inline int calc(int x) {
		if (k == 3) {
			int res = sum(x);
			if (((x / 4) & 1) ^ ((x & 3) >= 1)) res ^= 1;
			return res;
		}else {
			int res = sum(x);
			x >>= 1;
			res ^= (sum(x) << 1);
			if (((x / 4) & 1) ^ ((x & 3) >= 1)) res ^= 1;
			return res;
		}
	}
	
	void solve() {
		pw.push_back(0);
		for (int i = 1;; ++i) {
			ll x = 1;
			for (int j = 1; j <= k; ++j) {
				if ((mx + 1) / i <= x) x = mx + 1;
				else x *= i;
			}
			if (x > mx) break;
			pw.push_back(x);
		}
		
		int res;
		for (int qwq = 1; qwq <= T; ++qwq) {
			res = 0;
			for (auto x : vec[qwq]) {
				if (x == 0) continue;
				int pos = get_pos(x);
				res ^= calc(pos - 1) ^ pos;
				ll y = 1ll * pos * pos * pos;
				y = x - y;
				if (y) {
					if (((y - 1) / (pos + 1)) & 1) {
						y = (y - 1) % (pos + 1);
						res ^= sum(pos) ^ sum(y);
					}else {
						y = (y - 1) % (pos + 1);
						res ^= sum(y);
					}
				}
			}
			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]);
	}
	
//	subtask7 :: solve(); exit(0);
	
	if (subtask1 :: check()) subtask1 :: solve();
	else if (subtask2 :: check()) subtask2 :: solve();
	else if (subtask3 :: check()) subtask3 :: solve();
	else if (subtask4 :: check()) subtask4 :: solve();
	else if (subtask5 :: check()) subtask5 :: solve();
	else if (subtask6 :: check()) subtask6 :: solve();
	else if (subtask7 :: check()) subtask7 :: solve();
	return 0;
}
/*
1 3
5
7 10 18 3 25 
*/