#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e6 + 10;
const int mod = 998244353;
const int G = 3;
const int iG = (mod + 1) / 3;
int n, m, a[maxn], b[maxn], tr[maxn];
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + c - '0';
    c = getchar();
  }
  return x * f;
}
inline int ksm(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = 1ll * res * x % mod;
    x = 1ll * x * x % mod;
    y >>= 1;
  }
  return res;
}
inline void ntt(int *f, int len, int flag) {
  for (int i = 0; i < len; i++)
    if (i < tr[i]) swap(f[i], f[tr[i]]);
  for (int i = 2; i <= len; i <<= 1) {
    int w = ksm(flag ? G : iG, (mod - 1) / i);
    for (int j = 0, p = i >> 1; j < len; j += i) {
      int wi = 1;
      for (int k = j; k < j + p; k++) {
        int tt = 1ll * wi * f[k + p] % mod;
        f[k + p] = (f[k] - tt + mod) % mod;
        f[k] = (f[k] + tt) % mod;
        wi = 1ll * wi * w % mod;
      }
    }
  }
  if (flag == 0) {
    int iv = ksm(len, mod - 2);
    for (int i = 0; i < len; i++) f[i] = 1ll * f[i] * iv % mod;
  }
}
int main() {
  n = read(), m = read();
  for (int i = 1, x; i <= n; i++) x = read(), a[x] = b[x] = 1;
  int len = 1;
  for (; len <= m + m; len <<= 1)
    ;
  for (int i = 0; i < len; i++)
    tr[i] = (tr[i >> 1] >> 1) | ((i & 1) ? len >> 1 : 0);
  ntt(b, len, 1);
  for (int i = 0; i < len; i++) b[i] = 1ll * b[i] * b[i] % mod;
  ntt(b, len, 0);
  for (int i = 1; i <= m; i++)
    if (b[i] && !a[i]) return puts("NO"), 0;
  puts("YES");
  int tot = 0;
  for (int i = 1; i <= m; i++)
    if (a[i] && !b[i]) tot++;
  printf("%d\n", tot);
  for (int i = 1; i <= m; i++)
    if (a[i] && !b[i]) printf("%d ", i);
  return 0;
}
