#include <bits/stdc++.h>
using namespace std;
const int MAX = (1 << 21) + 5;
void fft(complex<double> a[], int n, bool invert) {
  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 * M_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 (int i = 0; i < n; ++i) a[i] /= n;
}
void multiply(int n, const int a[], const int b[], int res[]) {
  int pot = 1;
  while (pot < n) pot <<= 1;
  pot <<= 1;
  n = pot;
  static complex<double> fa[MAX], fb[MAX];
  for (int i = 0; i < n; i++) {
    fa[i] = a[i];
    fb[i] = b[i];
  }
  fft(fa, n, false), fft(fb, n, false);
  for (int i = 0; i < n; ++i) fa[i] *= fb[i];
  fft(fa, n, true);
  for (int i = 0; i < n; ++i) res[i] = int(fa[i].real() + 0.5);
}
int N, M;
int bag[MAX], conv[MAX];
vector<int> ans;
int main() {
  ios::sync_with_stdio(false);
  cin >> N >> M;
  bag[0] = 1;
  for (int i = 0; i < N; i++) {
    int x;
    cin >> x;
    bag[x] = 1;
  }
  multiply(M, bag, bag, conv);
  for (int i = 1; i <= M; i++) {
    if (conv[i] && !bag[i]) {
      cout << "NO" << endl;
      return 0;
    }
    if (conv[i] == 2) {
      ans.push_back(i);
    }
  }
  cout << "YES" << endl;
  cout << ans.size() << endl;
  for (int i = 0; i < (int)ans.size(); i++) {
    if (i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
  return 0;
}
