#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<vector<long long>> dp(N + 1, vector<long long>(K * 2 + 1, 0));
  dp[0][0] = 1;
  for (int i = 0; i < N; i++){
    for (int j = 0; j <= K * 2; j++){
      dp[i + 1][j] += dp[i][j];
      dp[i + 1][j] %= MOD;
      if (j + A[i] <= K * 2){
        dp[i + 1][j + A[i]] += dp[i][j];
        dp[i + 1][j + A[i]] %= MOD;
      }
    }
  }
  if (dp[N][K] == 0){
    cout << -1 << endl;
  } else {
    int ans = 0;
    for (int i = 0; i < N; i++){
      vector<long long> tmp = dp[N];
      for (int j = 0; j <= K * 2 - A[i]; j++){
        tmp[j + A[i]] -= tmp[j];
        tmp[j + A[i]] += MOD;
        tmp[j + A[i]] %= MOD;
      }
      if (tmp[K] == 0){
        ans++;
      }
    }
    cout << ans << endl;
  }
}