#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
using ll = long long;
const double PI = acos(-1);
void fft(vector<cd>& 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);
    cd wlen(cos(ang), sin(ang));
    for (int i = 0; i < n; i += len) {
      cd w(1);
      for (int j = 0; j < len / 2; j++) {
        cd 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 (cd& x : a) x /= n;
  }
}
vector<ll> multiply(vector<ll> const& a, vector<ll> const& b) {
  vector<cd> fa(a.begin(), a.end()), fb(b.begin(), b.end());
  int n = 1;
  while (n < a.size() + b.size()) n <<= 1;
  fa.resize(n);
  fb.resize(n);
  fft(fa, false);
  fft(fb, false);
  for (int i = 0; i < n; i++) fa[i] *= fb[i];
  fft(fa, true);
  vector<ll> result(n);
  for (int i = 0; i < n; i++) result[i] = round(fa[i].real());
  result.resize(a.size() + b.size());
  return result;
}
using namespace std;
class ELadiesShop {
 public:
  void solve(std::istream& cin, std::ostream& cout) {
    int n, m;
    cin >> n >> m;
    vector<ll> v(m + 1);
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      v[x] = 1;
    }
    vector<ll> mul = multiply(v, v);
    mul.resize(m + 1);
    int count = 0;
    for (int i = 1; i <= m; i++) {
      if (v[i] == 0 && mul[i] != 0) {
        cout << "NO" << endl;
        return;
      }
      if (v[i] == 1 && mul[i] == 0) count++;
    }
    cout << "YES" << endl;
    cout << count << endl;
    for (int i = 1; i <= m; i++)
      if (v[i] == 1 && mul[i] == 0) cout << i << " ";
    cout << endl;
  }
};
int main() {
  ELadiesShop solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
