模板：线性筛素数

// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 10000001
#define inf 1e9+7
int read()
{
    int f=1,x=0;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1; ch=getchar();}
    while (ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return f*x;
}
int pri[N],cnt,vis[N];
void init(int n)
{
    vis[1]=1;
    for(int i=2;i<=n;i++)
    {
        if(!vis[i])pri[++cnt]=i;
        for(int j=1;j<=cnt;j++)
        {
            if(i*pri[j]>n)break;
            vis[i*pri[j]]=1;
        }
    }
}
int main()
{
    int n=read(),m=read();
    init(n);
    while(m--)
    {
        int x=read();
        printf(vis[x]?"Non":"Yesn");
    }
}