#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1050000000;
const ll MOD = 1e9 + 7;
const int MINF = -1050000000;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  int n, a;
  cin >> n >> a;
  vector<int> x(n);
  for (int i = (int)0; i < (int)n; ++i) {
    cin >> x[i];
  }
  ll dp[55][55][2600];
  dp[0][0][0] = 1;
  for (int i = (int)0; i < (int)n; ++i) {
    for (int j = (int)0; j < (int)n; ++j) {
      for (int k = (int)0; k < (int)2500; ++k) {
        if (dp[i][j][k]) {
          dp[i + 1][j][k] += dp[i][j][k];
          dp[i + 1][j + 1][k + x[i]] += dp[i][j][k];
        }
      }
    }
  }
  ll ans = 0;
  for (int i = (int)1; i < (int)n + 1; ++i) ans += dp[n][i][i * a];
  cout << ans << endl;
  cout << "Yes" << endl;
  return 0;
}
