//线性筛法筛素数(欧拉筛法)

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<bitset>

 #include<cassert>

 #include<cctype>

 #include<cmath>

 #include<cstdlib>

 #include<ctime>

 #include<deque>

 #include<iomanip>

 #include<list>

 #include<map>

 #include<queue>

 #include<set>

 #include<stack>

 #include<vector>

 using namespace std;

 typedef long long ll;

 const double PI=acos(-1.0);

 const double eps=1e-;

 const ll mod=1e9+;

 const int inf=0x3f3f3f3f;

 const int maxn=2e7+;

 const int maxm=+;

 #define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

 bitset<maxn> is_prime;

 int p[maxn],h=;

 void Prime(int n)

 {

     is_prime[]=;

     is_prime[]=;

     for(int i=;i<=n;++i){

         if(is_prime[i]==)

             p[++h]=i;

         for(int j=;j<=h&&p[j]*i<=n;++j){

             is_prime[i*p[j]]=;

             if(i%p[j]==)

                 break;

         }

     }

 }

 int main()

 {

     int n,m;

     scanf("%d%d",&n,&m);

     Prime(n);

     for(int i=;i<=m;i++){

         int x;

         scanf("%d",&x);

         if(is_prime[x])

             printf("No\n");

         else

             printf("Yes\n");

     }

     return ;

 }