#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
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 (complex<double> &x : a) x /= n;
  }
}
vector<int> multiply_sq(vector<int> const &a) {
  vector<complex<double> > fa(a.begin(), a.end());
  int n = 1;
  while (n < 2 * a.size()) n <<= 1;
  fa.resize(n);
  fft(fa, false);
  for (int i = 0; i < n; i++) fa[i] *= fa[i];
  fft(fa, true);
  vector<int> res(n);
  for (int i = 0; i < n; i++) res[i] = (int)(round(fa[i].real()));
  return res;
}
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;
  }
  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;
  }
}
