CodeForces 286E

fft

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ld double
ld pi=acos(-1.0);   //注意π的精度
typedef __int64 ll;

const int N=1e6+100;
struct Complex
{
    double r,i;
    Complex(double rr=0,double ii=0){r=rr;i=ii;}
    Complex operator +(const Complex &x)const{return Complex(r+x.r,i+x.i);}
    Complex operator -(const Complex &x)const{return Complex(r-x.r,i-x.i);}
    Complex operator *(const Complex &x)const
    {
        return Complex(r*x.r-i*x.i,i*x.r+r*x.i);
    }
};

void Rader(Complex y[], int len) {
    for (int i = 1, j = len >> 1, k; i < len; j += k, i++) {
        if (i < j) swap(y[i], y[j]);
        for(k = len >> 1; j & k; k >>= 1) j ^= k;
    }
}
void FFT(Complex y[],int len,int on)
{
    Rader(y,len);
    for(int h=2;h<=len;h<<=1)//分治后计算长度为h的DFT
    {
        Complex wn(cos(on*2*pi/h),sin(on*2*pi/h));
        //单位复根e^(2*PI/m)用欧拉公式展开
        for(int j=0;j<len;j+=h)
        {
            Complex w(1,0);//旋转因子
            for(int k=j;k<(j+h/2);k++)
            {
                Complex u=y[k];
                Complex t=w*y[k+h/2];
                y[k]=u+t; y[k+h/2]=u-t;//蝴蝶合并操作
                w=w*wn;//更新旋转因子
            }
        }
    }
    if(on==-1)
        for(int i=0;i<len;i++) y[i].r/=len;
}
Complex a1[N*4];

int sta[N],top;
int ans[N],cnt;
int n,m;
int vis[N];

void getvis(){
    memset(vis,0,sizeof(vis));
    vis[0]=1;
    for(int i=0;i<top;i++)if(!vis[sta[i]]){
        int u=sta[i];
        for(int j=u;j<=m;j+=u){
            vis[j]=1;
        }
    }
}

void getfft(){
    int len=1;
    while(len<=2*m)len<<=1;
    memset(a1,0,sizeof(a1));
    for(int i=0;i<=m;i++)if(vis[i]){
        a1[i].r=1;
    }
    FFT(a1,len,1);
    for(int i=0;i<len;i++)a1[i]=a1[i]*a1[i];
    FFT(a1,len,-1);
    for(int i=0;i<=m;i++)vis[i]=(ll)(a1[i].r+0.5);
}

void pri(int ans[N],int n){
    for(int i=0;i<n;i++){
        printf("%d%c",ans[i],i==n-1?'\n':' ');
    }
}

int main(){
    #ifdef DouBi
    freopen("in.cpp","r",stdin);
    #endif // DouBi

    while(scanf("%d%d",&n,&m)!=EOF){
        top=0;
        for(int i=0;i<n;i++){
            int a;scanf("%d",&a);
            sta[top++]=a;
        }
        getvis();
        //pri(vis,m+1);
        getfft();
        //pri(vis,m+1);
        for(int i=1;i<=m;i++)if(vis[i]){
            top--;
        }
        if(top==0){
            printf("YES\n");
            cnt=0;
            for(int i=1;i<=m;i++)if(vis[i]==2){
                ans[cnt++]=i;
            }
            printf("%d\n",cnt);
            pri(ans,cnt);
        }
        else {
            printf("NO\n");
        }
    }
    return 0;
}