#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int INF = 1000 * 1000 * 1000 + 322;
const long long LLINF =
    2LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL + 57;
const int MOD = 1000 * 1000 * 1000 + 7;
const long long FFT_MOD = 998244353;
const int P1M = 1336337;
const int P1K = 1009;
const float PI = acos(-1.);
const float EPS = 1e-7;
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
  _out << _p.x << " " << _p.y;
  return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
  _in >> _p.x >> _p.y;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
  if (_v.empty()) return _out;
  _out << _v.front();
  for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
  for (auto &_i : _v) _in >> _i;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
  if (_m.empty()) return _out;
  _out << '(' << _m.begin()->x << ": " << _m.begin()->y << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
    _out << ", (" << _it->x << ": " << _it->y << ')';
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
  if (_m.empty()) return _out;
  _out << '(' << _m.begin()->x << ": " << _m.begin()->y << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
    _out << ", (" << _it->x << ": " << _it->y << ')';
  return _out;
}
const char *infile = "";
const char *outfile = "";
inline long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline int pwm(long long xx, long long pow, int MD = MOD) {
  if (pow < 0) {
    return pwm(pwm(xx, MD - 2, MD), -pow, MD);
  }
  long long mlt = 1;
  while (pow) {
    if (pow & 1) {
      mlt *= xx;
      mlt %= MD;
    }
    xx *= xx;
    pow >>= 1;
    xx %= MD;
  }
  return (int)mlt;
}
inline int inv(long long r, int _mod = MOD) {
  return pwm(r % _mod, _mod - 2, _mod);
}
struct cmpl {
  float x, y;
  cmpl(float xx = 0, float yy = 0) : x(xx), y(yy) {}
  cmpl operator+(const cmpl &oth) const { return cmpl(x + oth.x, y + oth.y); }
  cmpl operator-(const cmpl &oth) const { return cmpl(x - oth.x, y - oth.y); }
  cmpl operator*(const cmpl &oth) const {
    return cmpl(x * oth.x - y * oth.y, x * oth.y + y * oth.x);
  }
};
const int L = 21;
const int N = (1 << L);
int rev[N];
cmpl *wptr[L], *wiptr[L];
cmpl w[N], wi[N];
void fft(cmpl *a, bool inv) {
  for (int i = 0; i < N; ++i) {
    if (i < rev[i]) {
      swap(a[i], a[rev[i]]);
    }
  }
  for (int j = 0; j < L; ++j) {
    int bl = (1 << j);
    for (int ptr = 0; ptr < N; ptr += 2 * bl) {
      cmpl *ww = inv ? wptr[j] : wiptr[j];
      for (int pos = 0; pos < bl; ++pos) {
        cmpl tmp = a[ptr + pos] + ww[pos] * a[ptr + pos + bl];
        a[ptr + pos + bl] = a[ptr + pos] - ww[pos] * a[ptr + pos + bl];
        a[ptr + pos] = tmp;
      }
    }
  }
  if (inv) {
    for (int i = 0; i < N; ++i) {
      a[i].x /= N;
    }
  }
}
cmpl a[N];
int op[N], op1[N];
void mult() {
  for (int i = 0; i < N; ++i) {
    a[i].x = op[i];
  }
  fft(a, false);
  for (int i = 0; i < N; ++i) {
    a[i] = a[i] * a[i];
  }
  fft(a, true);
  for (int i = 0; i < N; ++i) {
    op1[i] = (int)(a[i].x + 0.5);
  }
}
int v[N >> 1];
inline void solve() {
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < L; ++j) {
      rev[i] <<= 1;
      rev[i] |= ((i >> j) & 1);
    }
  }
  int cur = 0;
  for (int j = 0; j < L; ++j) {
    int bl = (1 << j);
    wptr[j] = w + cur;
    wiptr[j] = wi + cur;
    for (int i = 0; i < bl; ++i) {
      float sn = sin(PI / bl * i);
      float cs = cos(PI / bl * i);
      w[cur] = cmpl(cs, sn);
      wi[cur] = cmpl(cs, -sn);
      ++cur;
    }
  }
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i) {
    scanf("%d", v + i);
    op[v[i]] = 1;
  }
  mult();
  int ptr = 0;
  for (int i = 0; i <= m; ++i) {
    if (op1[i] != 0 && op[i] == 0) {
      printf("NO\n");
      return;
    } else if (op1[i] == 0 && op[i] != 0) {
      v[ptr++] = i;
    }
  }
  printf("YES\n%d\n", ptr);
  for (int i = 0; i < ptr; ++i) {
    printf("%d ", v[i]);
  }
  printf("\n");
}
int main() {
  if (*infile != '\0') (void)freopen(infile, "r", stdin);
  if (*outfile != '\0') (void)freopen(outfile, "w", stdout);
  cout.tie(nullptr);
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cout << setprecision(20);
  cout << fixed;
  solve();
  return 0;
}
