#include<bits/stdc++.h>
using namespace std; 
long long a,n,po[1005],ls;
void init(){
	for(int i=1;i<=1002;i++) po[i]=i*i;
}
int main(){
	init();
	cin>>a>>n;
	for(int i=1;i<=1002;i++)
		if(a<=po[i]){
			ls=po[i];
			break;
		}
	while(n--){
		int x;
		cin>>x;
		int l=1,r=1002;
		while(l<=r){
			int mid=(l+r)/2;
			if(po[mid]>x) r=mid-1;
			else l=mid+1;
		}
		if((x==po[l-1]&&x>=ls)||x%ls==0) cout<<"lucky"<<"\n";
		else if(x<=ls) cout<<ls<<"\n";
		else{
			while(x%po[l-1]!=0) x++;
			cout<<x<<"\n"; 
		}
	}
    return 0;
}