#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

inline LL read () { LL res =  ;int f () ;char ch = getchar ();

    while (!isdigit(ch)) { if (ch == '-') f = - ;ch = getchar();}

    while (isdigit(ch)) res = (res << ) + (res << ) + (ch ^ ) ,ch = getchar(); return res * f ;

}

template<class T>void write(T x){

  if(x>) write(x/);

  putchar(+x%);

}

int const maxn=<<;

int n,p,a[maxn],b[maxn],m,check,pos[maxn];

int inline pw(int x){

  return x<? :;

}

inline void dfs(int k,int x,int y,int num){

  if(x== and y== and num){

    puts("Yes"); write(num);putchar('\n');

    for(register int i=;i<=num;i++) write(b[i]),putchar(' '); exit();

  }

  if(k>m) return ;

  dfs(k+,x,y,num);

  b[num+]=pos[a[k]];

  dfs(k+,x^a[k],(y*pw(a[k])+a[k])%p,num+);

}

signed main () {

    n=read(),p=read();

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

        int x=read();

        if(x<maxn) a[++m]=x,pos[x]=i;

    }

    dfs(,,,); puts("No");

    return ;

}