55分，剩下的都WA，求调 加急

#include <bits/stdc++.h>
using namespace std;
int v[1100005];

int main()
{
    memset(v, 0, sizeof(v));
    int a, n, x;
    cin >> a >> n;
    x = sqrt(a);
    if (x * x != n)
        x++;
    for (int i = x; i <= 1001; i++)
    {
        x = i * i;
        v[x] = x;
        for (int j = x * 2; j <= 1100005; j += x)
        {
            v[j] = j;
        }
    }
    x = 1001 * 1001;
    for (int i = x; i >= 0; i--)
    {
        if (v[i] != 0)
            x = i;
        else
            v[i] = x;
    }
    while (n--)
    {
        cin>>x;
        if(v[x]==x)
            printf("lucky\n");
        else
            printf("%d\n",v[x]);
    }
    return 0;
}