【Template】Miller Rabin

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
//#include<stack>
#include<bitset> 
#define R(a,b,c) for(register int (a)=(b);(a)<=(c);++(a))
#define nR(a,b,c) for(register int (a)=(b);(a)>=(c);--(a))
#define Ii inline int
#define Iv inline void
#define Il inline long long
#define Ib inline bool
#define INF 0x7ffffff
#define re register
#define ll long long
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define Cmin(a,b) ((a)=(a)<(b)?(a):(b))
#define Cmax(a,b) ((a)=(a)>(b)?(a):(b))
#define Fill(a,b) memset((a),(b),sizeof((a)))
#define D_e_Line printf("
-------------
");
#define D_e(x) printf("
______%d_______
",x)
#define Pause() system("pause")
using namespace std;
Ii read(){
    int s=0,f=1;char c;
    for(c=getchar();c>'9'||c<'0';c=getchar())if(c=='-')f=-1;
    while(c>='0'&&c<='9')s=s*10+(c^'0'),c=getchar();
    return s*f;
}
template<class T>Iv print(T x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)print(x/10);
    putchar(x%10^'0');    
}
int base[3]={2,7,61};
ll Pow(ll a,ll b,ll mod){
    ll s=1;
    while(b){
        if(b&1)s=(s*a)%mod;
        a=a*a%mod,b>>=1;
    }
    return s%mod;
}
Ib Miller_Rabin(ll n){
    if(n==2||n==7||n==61)return 1;
    if(n<2||n%2==0||n%7==0||n%61==0)return 0;
    R(i,0,2){
        int flag=0;
        ll a=base[i];
        ll tmp=n-1;int k=0;
        while(tmp%2==0)
            ++k,tmp>>=1;
        ll x=Pow(a,tmp,n);
        if(x==1||x==n-1){flag=1;continue;}
        while(k--){
            x=x*x%n;
            if(x==n-1){
                flag=1;break;
            }
        }
        if(!flag)return 0;
    }
    return 1;
}
int main(){
    int n=read(),T=read();
    while(T--){
        (Miller_Rabin(read())==1)?
            printf("Yes
"):
            printf("No
");
    }
    return 0;
}