#include <bits/stdc++.h>
using namespace std;
const int maxN = 2100000;
const double pi = acos(-1);
const double eps = 0.5;
complex<double> a1[maxN], a2[maxN];
int tmp[maxN];
int n, m;
int a[maxN], luu[maxN], dau[maxN];
void fft(complex<double> *a, int n, int rev) {
  for (int i = 1, j = 0; i < n; i++) {
    for (int k = n >> 1; k > (j ^= k); k >>= 1)
      ;
    if (i < j) swap(a[i], a[j]);
  }
  for (int i = 2; i <= n; i <<= 1) {
    double angle = 2 * pi / i * rev;
    complex<double> wlen(cos(angle), sin(angle));
    for (int j = 0; j < n; j += i) {
      complex<double> w(1, 0);
      for (int k = j, _b = j + i / 2 - 1; k <= _b; k++) {
        complex<double> x = a[k], y = w * a[k + i / 2];
        a[k] = x + y;
        a[k + i / 2] = x - y;
        w *= wlen;
      }
    }
  }
  if (rev == -1)
    for (int i = 0, _b = n - 1; i <= _b; i++) a[i] /= n;
}
void mul(int *tmp1, int *tmp2, int n) {
  for (int i = 0, _b = n - 1; i <= _b; i++) {
    a1[i] = 1.0 * tmp1[i], a2[i] = 1.0 * tmp2[i];
  }
  fft(a1, n, 1);
  fft(a2, n, 1);
  for (int i = 0, _b = n - 1; i <= _b; i++) a1[i] *= a2[i];
  fft(a1, n, -1);
  for (int i = 0, _b = n - 1; i <= _b; i++) tmp1[i] = int(a1[i].real() + eps);
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    a[i] = x;
    dau[x] = 1;
    tmp[x] = 1;
  }
  int maxn = 1;
  while (maxn <= 2 * m) maxn <<= 1;
  mul(tmp, tmp, maxn);
  int dem = 0;
  for (int i = 1; i <= n; i++) {
    if (tmp[a[i]] == 0) {
      luu[++dem] = a[i];
    }
  }
  for (int i = 1; i <= m; i++)
    if (tmp[i] != 0 && dau[i] == 0) {
      cout << "NO";
      return 0;
    }
  cout << "YES\n" << dem << endl;
  for (int i = 1; i <= dem; i++) cout << luu[i] << ' ';
}
