#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using pii = pair<int, int>;
using point = complex<ld>;
int const N = (1 << 22);
ld const PI = acos(-1);
int n, m, b;
point a[N];
bool mark[N];
void fft(point a[N], int inv) {
  for (int i = 0; i < n; i++) {
    int rev = 0;
    for (int j = 0; j < b; j++)
      if (i >> j & 1) rev |= (1 << (b - j - 1));
    if (rev > i) swap(a[i], a[rev]);
  }
  for (int len = 2; len <= n; len *= 2) {
    point wn = point(cos(2 * PI / len), inv * sin(2 * PI / len));
    for (int i = 0; i < n; i += len) {
      point w = point(1, 0);
      for (int j = 0; j < len / 2; j++) {
        point ex1 = a[i + j] + w * a[i + j + len / 2];
        point ex2 = a[i + j] - w * a[i + j + len / 2];
        a[i + j] = ex1;
        a[i + j + len / 2] = ex2;
        w *= wn;
      }
    }
  }
  if (inv == -1) {
    for (int i = 0; i < n; i++) a[i] /= n;
  }
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0, x; i < n; i++) {
    cin >> x;
    a[x] = point(1, 0);
    mark[x] = 1;
  }
  n = 1, b = 0;
  while (n < 2 * m) n *= 2, b++;
  fft(a, 1);
  for (int i = 0; i < n; i++) a[i] = a[i] * a[i];
  fft(a, -1);
  vector<int> res;
  for (int i = 1; i <= m; i++) {
    if (!mark[i] && a[i].real() > 0.5) return cout << "NO\n", 0;
    if (mark[i] && a[i].real() < 0.5) res.push_back(i);
  }
  cout << "YES\n";
  cout << (int)res.size() << '\n';
  for (int x : res) cout << x << ' ';
  cout << '\n';
}
