#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int N = (1 << 22);
int n, m, l;
complex<double> a[N];
bool mark[N];
vector<int> res;
void fft(complex<double> a[], int inv) {
  for (int i = 0; i < n; i++) {
    int rev = 0;
    for (int j = 0; j < l; j++)
      if (i >> j & 1) rev |= (1 << (l - j - 1));
    if (rev > i) swap(a[i], a[rev]);
  }
  for (int len = 2; len <= n; len *= 2) {
    complex<double> wn(cos(2 * PI / len), inv * sin(2 * PI / len));
    for (int i = 0; i < n; i += len) {
      complex<double> w(1, 0);
      for (int j = 0; j < len / 2; j++) {
        complex<double> ex1 = a[i + j] + w * a[i + j + len / 2];
        complex<double> 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() {
  scanf("%d %d ", &n, &m);
  for (int i = 0, x; i < n; i++) {
    scanf("%d ", &x);
    mark[x] = 1;
    a[x] = complex<double>(1, 0);
  }
  n = 1;
  while (n < 2 * m) n *= 2, l++;
  fft(a, 1);
  for (int i = 0; i < n; i++) a[i] *= a[i];
  fft(a, -1);
  for (int i = 0; i <= m; i++) {
    if (!mark[i] && a[i].real() > 0.5) return !printf("NO\n");
    if (mark[i] && a[i].real() < 0.5) res.push_back(i);
  }
  printf("YES\n");
  printf("%d\n", res.size());
  for (int x : res) printf("%d ", x);
  printf("\n");
}
