#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
ll read(){
	char c=getchar();ll x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
const ll INF=0x3f3f3f3f3f3f3f3f;
const int N=5000000;
inline ll qp(ll a,int b){
	ll res=1;
	while(b) --b,res*=a;
	return res;
}
ll a[N];
int g[N+3],k;
ll dp(ll p,ll t){
	t%=(p+1);
	if(!t) return p;
	if(k&1) return t-1;
	else{
		if(t==1) return p>>(__builtin_ctzll(p)+1);
		else return dp(p-(t>>1),t&1);
	}
}
inline ll h0(ll p){
	switch(p&3){
	case 0: return p;
	case 1: return 1;
	case 2: return p^1;
	}
	return 0;
}
inline ll h1(ll p){
	ll res=0;
	for(int t=0;(3ll<<t)<=p;++t) res^=h0((p-(1ll<<t))>>(t+1));
	return res;
}
inline ll sigma(ll p){
	if(!p) return 0;
	if(k&1) return h0(p)^((p&7)<=4&&(p&7));
	else return h1(p+1);
}
inline ll s(ll p,ll t){
	t%=((p+1)<<1);
	ll tmp=0;
	if(t>p){tmp=h0(p);t-=p+1;}
	if(!t) return tmp^p;
	if(k&1) return tmp^p^h0(t-1);
	else return tmp^h0(p)^h0(p-(t>>1)-1)^h1(p)^h1(p-((t+1)>>1));
}
inline ll sol(ll x){
	ll p=pow(x,1.0/k);
	while(qp(p,k)<=x) ++p;
	while(qp(p,k)>x) --p;
	return sigma(p-1)^s(p,x-qp(p,k));
}
void solve(){
	int n=read();
	ll cur=0;
	if(k==1){
		while(n--) cur^=h0(read());
	}
	else{
		while(n--) cur^=sol(read());
	}
	if(cur) puts("Lily");
	else puts("Kaguya");
}
int main(){
	int tc=read();
	k=read();
	while(tc--) solve();
	return 0;
}