#include <bits/stdc++.h>
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
using namespace ::std;
const int maxn = 3e6 + 500;
const int inf = 1e9 + 800;
const int mod = 1e9 + 7;
const long double pi = 3.14159265359;
complex<long double> a[maxn];
complex<long double> b[maxn];
void fft(complex<long double> a[], int n, int logg, int inv) {
  for (int i = 0; i < n; i++) {
    int x = 0;
    for (int j = 0; j < logg; j++) {
      if ((i & (1 << j))) x |= (1 << (logg - j - 1));
    }
    if (x > i) swap(a[i], a[x]);
  }
  for (int len = 2; len <= n; len *= 2) {
    complex<long double> wn = polar((long double)1, 2 * inv * pi / len);
    for (int i = 0; i < n; i += len) {
      complex<long double> pw;
      pw.real(1);
      pw.imag(0);
      for (int j = 0; j < len / 2; j++) {
        complex<long double> x = a[i + j] + pw * a[i + j + len / 2];
        complex<long double> y = a[i + j] - pw * a[i + j + len / 2];
        a[i + j] = x;
        a[i + j + len / 2] = y;
        pw *= wn;
      }
    }
  }
  if (inv == -1) {
    for (int i = 0; i < n; i++) {
      a[i] /= n;
    }
  }
}
void zarb(int n, int logg) {
  fft(a, n, logg, 1);
  fft(b, n, logg, 1);
  for (int i = 0; i < n; i++) {
    a[i] *= b[i];
  }
  fft(a, n, logg, -1);
}
bool sa[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> m >> n;
  int sn = n;
  a[0].real(1);
  b[0].real(1);
  for (int i = 0; i < m; i++) {
    int v;
    cin >> v;
    sa[v] = 1;
    a[v].real(1);
    b[v].real(1);
  }
  m = 1;
  int logg = 0;
  while (m < n) {
    m *= 2;
    logg++;
  }
  n = m;
  n *= 2;
  logg++;
  zarb(n, logg);
  vector<int> vec;
  for (int i = 1; i <= sn; i++) {
    if (!sa[i] && a[i].real() > 0.5) {
      cout << "NO" << endl;
      ;
      return 0;
    }
    if (a[i].real() > 0.5 && a[i].real() < 2.5) vec.push_back(i);
  }
  cout << "YES" << endl << vec.size() << endl;
  for (auto e : vec) cout << e << ' ';
}
