#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=100003;
inline int qp(int a,int b){
	int res=1;
	while(b) --b,res*=a;
	return res;
}
ll a[N];
int k;
ll qry(ll x){
	if(x==1) return 1;
	if(x==0||x==2) return 0;
	if(x&1) return ((x+1)>>1);
	else return qry(x-((x+3)>>1));
}
ll sol(ll x){
	if(!x) return 0;
	ll p=sqrt(x);
	while(p*p<=x) ++p;
	while(p*p>x) --p;
	ll t=x-p*p;
	if(t>p) t-=p+1;
	if(!t) return p;
	p-=t>>1;
	if(t&1){
		if(p<=4) return p==3;
		return qry(p-2);
	}
	else return p;
}
int f[N+3],g[N+3];
bool vis[N+3];
ll go(ll x){
	ll p=pow(x,1.0/3);
	while(p*p*p<=x) ++p;
	while(p*p*p>x) --p;
	ll t=x-p*p*p;
	if(!t) return p;
	return (t-1)%(p+1);
}
ll pps(ll p,ll t){
	t%=(p+1);
	if(!t) return p;
	t-=p+1;
	t+=p*p*p*p;
	--p;
	return pps(p,t-p*p*p*p);
}
ll ps(ll x){
	ll p=sqrt(sqrt(x));
	while(qp(p,4)<=x) ++p;
	while(qp(p,4)>x) --p;
	ll t=x-qp(p,4);
	return pps(p,t);
}
ll rush(ll x){
	ll p=pow(x,1.0/5);
	while(qp(p,5)<=x) ++p;
	while(qp(p,5)>x) --p;
	ll t=x-qp(p,5);
	if(!t) return p;
	return (t-1)%(p+1);
}
void solve(){
	if(k==1){
		int n=read();
		ll cur=0;
		while(n--){
			ll x=read();
			switch(x%4){
			case 0:cur^=x;break;
			case 1:cur^=1;break;
			case 2:cur^=x+1;break;
			}
		}
		if(cur) puts("Lily");
		else puts("Kaguya");
		return;
	}
	bool fl=1;
	int n=read();
	for(int i=1;i<=n;++i) a[i]=read(),fl&=a[i]<=N;
	if(fl){
		int cur=0;
		for(int i=1;i<=n;++i) cur^=g[a[i]];
		if(cur) puts("Lily");
		else puts("Kaguya");
		return;
	}
	if(k==2){
		ll cur=0;
		for(int i=2;i<=n;i+=2) cur^=sol(a[i]);
		if(cur) puts("Lily");
		else puts("Kaguya");
		return;
	}
	if(k==3){
		ll cur=0;
		for(int i=2;i<=n;i+=2) cur^=go(a[i]);
		if(cur) puts("Lily");
		else puts("Kaguya");
		return;
	}
	if(k==4){
		ll cur=0;
		for(int i=2;i<=n;i+=2) cur^=ps(a[i]);
		if(cur) puts("Lily");
		else puts("Kaguya");
		return;
	}
	if(k==5){
		ll cur=0;
		for(int i=2;i<=n;i+=2) cur^=rush(a[i]);
		if(cur) puts("Lily");
		else puts("Kaguya");
		return;
	}
}
int main(){
	int tc=read();
	k=read();
	if(k>1){
		for(int i=1,j=0;i<=N;++i){
			while(qp(j+1,k)<=i) ++j;
			if(qp(j,k)==i) f[i]=j;
			else f[i]=f[i-j-1];
		}
	}
	while(tc--) solve();
	return 0;
}