#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
const double PI = acos(-1);
int reverse(int num, int lg_n) {
  int res = 0;
  for (int i = 0; i < lg_n; i++) {
    if (num & (1 << i)) res |= 1 << (lg_n - 1 - i);
  }
  return res;
}
void fft(vector<cd>& a, bool invert) {
  int n = a.size();
  int lg_n = 0;
  while ((1 << lg_n) < n) lg_n++;
  for (int i = 0; i < n; i++) {
    if (i < reverse(i, lg_n)) swap(a[i], a[reverse(i, lg_n)]);
  }
  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, 0);
      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<int> multiply(vector<int> const& a, vector<int> 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<int> result(n);
  for (int i = 0; i < n; i++) result[i] = round(fa[i].real());
  return result;
}
const int N = 1e6 + 100;
int n, m;
int main() {
  scanf("%d", &n), scanf("%d", &m);
  vector<int> vec(m + 1, 0);
  for (int i = 0; i < n; ++i) {
    int v;
    scanf("%d", &v);
    vec[v] = 1;
  }
  vector<int> res = multiply(vec, vec);
  for (int i = 1; i <= m; i++)
    if (res[i] && !vec[i]) return puts("NO");
  vector<int> out;
  for (int i = 1; i <= m; i++)
    if (vec[i] && !res[i]) out.push_back(i);
  puts("YES");
  cout << out.size() << endl;
  for (int i = 0; i < out.size(); ++i) printf("%d ", out[i]);
}
