#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const double EPS = 1e-7;
const double PI = acos(-1);
const int MaxLength = 1 << 21;
void fft(vector<complex<double> > &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) {
    double ang = 2 * PI / len * (invert ? -1 : 1);
    complex<double> wlen(cos(ang), sin(ang));
    for (int i = 0; i < n; i += len) {
      complex<double> w(1);
      for (int j = 0; j < len / 2; ++j) {
        complex<double> u = a[i + j], v = a[i + j + len / 2] * w;
        a[i + j] = u + v;
        a[i + j + len / 2] = u - v;
        w *= wlen;
      }
    }
  }
  if (invert)
    for (int i = 0; i < n; ++i) a[i] /= n;
}
void multiply(const vector<int> &a, const vector<int> &b, vector<int> &res) {
  vector<complex<double> > fa(a.begin(), a.end()), fb(b.begin(), b.end());
  size_t n = 1;
  while (n < max(a.size(), b.size())) n <<= 1;
  n <<= 1;
  fa.resize(n), fb.resize(n);
  fft(fa, false), fft(fb, false);
  for (size_t i = 0; i < n; ++i) fa[i] *= fb[i];
  fft(fa, true);
  res.resize(n);
  for (size_t i = 0; i < n; ++i) res[i] = int(fa[i].real() + 0.5);
}
const int MAXN = 1000010;
int x[MAXN];
vector<int> a;
vector<int> b;
map<int, bool> S;
int main() {
  ios::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  a.resize(m + 1);
  for (int i = 0; i < n; i++) {
    cin >> x[i];
    S[x[i]] = true;
    a[x[i]] = 1;
  }
  multiply(a, a, b);
  vector<int> sol;
  bool valid = true;
  for (int i = 0; i <= m; i++)
    if (b[i] && S.find(i) == S.end()) valid = false;
  for (int i = 0; i < n; i++)
    if (!b[x[i]]) sol.push_back(x[i]);
  if (valid) {
    cout << "YES" << endl;
    cout << sol.size() << endl;
    for (int i = 0; i < (int)sol.size(); i++)
      cout << sol[i] << (i == (int)sol.size() - 1 ? '\n' : ' ');
  } else
    cout << "NO" << endl;
  return 0;
}
