#include <bits/stdc++.h>
using namespace std;
bool f[33][33][50005];
bool all[33][33][50005];
int n, p;
int t;
int b[35];
bool flag;
int gt[33];
int num[33];
inline int add(int x, int y) {
  if (y >= 10)
    x *= 100;
  else
    x *= 10;
  x += y;
  return x % p;
}
int main() {
  scanf("%d%d", &n, &p);
  f[0][0][0] = 1;
  for (int i = (1); i <= (int)n; i++) {
    int x;
    scanf("%d", &x);
    if (x >= 32) continue;
    b[++t] = x;
    num[t] = i;
    for (int j = (0); j <= (int)31; j++)
      for (int k = (0); k <= (int)p - 1; k++)
        if (f[t - 1][j][k]) {
          f[t][j][k] = 1;
          all[t][j][k] = 0;
          int y = add(k, x);
          f[t][j ^ x][y] = 1;
          all[t][j ^ x][y] = 1;
          if (j == x && !y) {
            flag = 1;
            goto yes;
          }
        }
  }
yes:;
  if (flag) {
    printf("Yes\n");
    int top = 0;
    int u = 0;
    int v = 0;
    for (int i = (t); i >= (int)1; i--) {
      if (all[i][u][v]) {
        gt[++top] = num[i];
        u ^= b[i];
        for (int j = (0); j <= (int)p - 1; j++)
          if (f[i - 1][u][j] && add(j, b[i]) == v) {
            v = j;
            break;
          }
      }
    }
    printf("%d\n", top);
    for (int i = (top); i >= (int)1; i--) printf("%d ", gt[i]);
  } else
    printf("No\n");
  return 0;
}
