#include<bits/stdc++.h>
#define ll long long
using namespace std;
int T,k,n;
ll ksm(ll x,int y){
	ll res=1;
	while(y){
		if(y&1)res=res*x;
		x=x*x,y>>=1;
	}
	return res;
}
ll h0(ll x){
	return (x&1?1:x)^(x>>1&1);
}
ll h1(ll x){
	if(x<2)return 0;
	return h1(x-1ll>>1)^h0(x>>1);
}
ll S(ll x){
	if(!x)return 0;
	if(k%2==0)return h1(x);
	return (h0(x)^(x%8ll>=1ll&&x%8ll<=4ll));
}
ll s(ll r,ll d){
	d%=(2ll*r+2ll);
	if(d>r)return (h0(r)^s(r,d-r-1ll));
	if(k%2==0)return (h0(r)^h0(r-d/2ll-1ll)^h1(r)^h1(r-(d+1ll)/2ll-1ll));
	if((k&1ll)&&!d)return r;
	if(k&1ll)return (r^h0(d-1ll));
}
ll calc(ll x){
	if(k==1)return h0(x);
	ll r=pow(x,1.0/k);
	while(ksm(r+1ll,k)<=x)++r;
	while(ksm(r,k)>x)--r;
	return (S(r-1ll)^s(r,x-ksm(r,k)));
}
void solve(){
	scanf("%d",&n);
	ll ans=0;
	while(n--){
		ll x;scanf("%lld",&x);
		ans^=calc(x);
	}
	if(!ans)puts("Kaguya");
	else puts("Lily");
}
int main(){
	cin>>T>>k;
	while(T--)solve();
	return 0;
}