50求调

#include<bits/stdc++.h>
using namespace std;
int a, n, x[200002];
int zhuanl(int op) {for (int i = 1;; i++) {if (i * i >= a)return i * i;}}
int zhuan(int op) {for (int i = a;; i++) {if (i % a == 0 && i >= op)return i;}}
int main() {
	cin >> a >> n;
	for (int i = 0; i < n; i++) {cin >> x[i];}
	for (int i = 0; i < n; i++) {
		int l = 0, r = int(sqrt(1000001)), mid, ans = 0;
		while (l <= r) {
			mid = (l + r) / 2;
			if (mid * mid >= x[i]) {
				if (mid * mid == x[i]) {
					ans = mid;
					break;
				}
				r = mid - 1;
			} else l = mid + 1;
		}
		if (ans == 0) {
			if (x[i] % a == 0) {cout << "lucky\n";} 
            else cout << zhuan(x[i]) << endl;
		} else {
			if (x[i] < a) {cout << zhuanl(x[i]) << endl;}
            else {cout << "lucky\n";}
		}
	}
}