#include <bits/stdc++.h>
using namespace std;
int MOD, root, root_1, root_pw;
int modexp(int a, int n) {
  if (n == 0) return 1;
  int p = modexp(a, n >> 1);
  p = (int)(1LL * p * p % MOD);
  if (n & 1) p = (int)(1LL * p * a % MOD);
  return p;
}
int modinv(int a) {
  int ret = modexp(a, MOD - 2);
  return ret >= 0 ? ret : ret + MOD;
}
void fft(vector<int> &a, bool invert) {
  int n = a.size();
  for (int i = 1, j = 0; i < n; i++) {
    int bit = n >> 1;
    for (; j & bit; bit >>= 1) j ^= bit;
    j ^= bit;
    if (i < j) swap(a[i], a[j]);
  }
  for (int len = 2; len <= n; len <<= 1) {
    int wlen = invert ? root_1 : root;
    for (int i = len; i < root_pw; i <<= 1)
      wlen = (int)(1LL * wlen * wlen % MOD);
    for (int i = 0; i < n; i += len) {
      int w = 1;
      for (int j = 0; j < len / 2; j++) {
        int u = a[i + j];
        int v = (int)(1LL * a[i + j + len / 2] * w % MOD);
        a[i + j] = u + v < MOD ? u + v : u + v - MOD;
        a[i + j + len / 2] = u - v >= 0 ? u - v : u - v + MOD;
        w = (int)(1LL * w * wlen % MOD);
      }
    }
  }
  if (invert) {
    int n_1 = modinv(n);
    for (int &x : a) x = (int)(1LL * x * n_1 % MOD);
  }
}
vector<int> multiply_sq(vector<int> const &a) {
  vector<int> fa(a.begin(), a.end());
  int n = 1;
  while (n < (a.size() << 1)) n <<= 1;
  fa.resize(n);
  fft(fa, false);
  for (int i = 0; i < n; i++) fa[i] = (int)(1LL * fa[i] * fa[i] % MOD);
  fft(fa, true);
  return fa;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, x;
  cin >> n >> m;
  vector<int> p(m + 1, 0);
  for (int i = 0; i < n; i++) {
    cin >> x;
    p[x] = 1;
  }
  MOD = 918552577;
  root = 86995699;
  root_1 = 324602258;
  root_pw = 1 << 22;
  vector<int> q = multiply_sq(p);
  int flag = 0;
  vector<int> ans;
  for (int i = 1; i <= m; i++) {
    if (q[i] > 0 && p[i] != 1) {
      flag = 1;
      break;
    }
    if (q[i] == 0 && p[i] == 1) ans.push_back(i);
  }
  if (flag)
    cout << "NO\n";
  else {
    cout << "YES\n";
    cout << ans.size() << endl;
    for (int &x : ans) cout << x << " ";
    cout << endl;
  }
}
