#include <bits/stdc++.h>
using namespace std;
int n, p, over, pos[50], ans[50];
vector<int> disc;
int connect(int now, int val, int mod) {
  if (val < 10)
    now = now * 10 + val;
  else
    now = now * 100 + val;
  return now % mod;
}
void dfs(int now, int siz, int exc, int cnt) {
  if (over) return;
  if (siz != 0 && exc == 0 && cnt == 0) {
    printf("Yes\n%d\n", siz);
    for (int i = 1; i <= siz; ++i) printf("%d ", ans[i - 1]);
    over = 1;
    return;
  }
  if (now == (int)disc.size()) return;
  ans[siz] = pos[now];
  dfs(now + 1, siz + 1, exc ^ disc[now], connect(cnt, disc[now], p));
  dfs(now + 1, siz, exc, cnt);
}
signed main() {
  scanf("%d %d", &n, &p);
  disc.push_back(0);
  for (int i = 1, x; i <= n; ++i) {
    scanf("%d", &x);
    if (x <= 24) {
      disc.push_back(x);
      pos[disc.size() - 1] = i;
    }
  }
  dfs(1, 0, 0, 0);
  if (over == 0) puts("No");
  return 0;
}
