#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int MAX = 1 << 21, MOD = 1e9 + 7;
const double PI = acos(-1);
complex<double> a[MAX];
int hav[MAX], n, m;
vector<int> ans;
inline int rev(int i) {
  int ret = 0;
  for (int j = 0; j < 21; j++)
    if ((i >> j) & 1) ret |= (1 << (20 - j));
  return ret;
}
void fft(bool inv) {
  for (int i = 0; i < MAX; i++)
    if (rev(i) > i) swap(a[rev(i)], a[i]);
  for (int len = 2; len <= MAX; len *= 2) {
    double ang = 2 * PI / len * (inv ? -1 : 1);
    complex<double> wn(cos(ang), sin(ang));
    for (int i = 0; i < MAX; i += len) {
      complex<double> w(1., 0.);
      for (int j = 0; j < len / 2; j++) {
        complex<double> t = a[i + j] - w * a[i + j + len / 2];
        a[i + j] += w * a[i + j + len / 2];
        a[i + j + len / 2] = t;
        w *= wn;
      }
    }
  }
  if (inv)
    for (int i = 0; i < MAX; i++) a[i] /= MAX;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> m, m++;
  for (int i = 0, x; i < n; i++) cin >> x, a[x] = 1, hav[x] = true;
  fft(0);
  for (int i = 0; i < MAX; i++) a[i] *= a[i];
  fft(1);
  for (int i = 0; i < MAX; i++)
    if (hav[i] and a[i].real() < .5)
      ans.push_back(i), a[i] = complex<double>(1., 0.);
  for (int i = 0; i < m; i++)
    if (a[i].real() > .5 and !hav[i]) return cout << "NO\n", 0;
  cout << "YES\n" << ans.size() << '\n';
  for (auto val : ans) cout << val << ' ';
  cout << '\n';
  return 0;
}
