#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll N, K;
  cin >> N >> K;
  assert(N <= 10000 && K <= 1000);
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }

  vector dp1(N + 1, vector(K + 1, false));
  vector dp2(N + 1, vector(K + 1, false));
  dp1.at(0).at(0) = true;
  dp2.at(N).at(0) = true;
  for (ll i = 0; i < N; i++)
  {
    for (ll j = 0; j <= K; j++)
    {
      if (!dp1.at(i).at(j))
        continue;
      ll nj = j + A.at(i);
      if (nj <= K)
        dp1.at(i + 1).at(nj) = true;
      dp1.at(i + 1).at(j) = true;
    }
  }
  for (ll i = N - 1; i >= 0; i--)
  {
    for (ll j = 0; j <= K; j++)
    {
      if (!dp2.at(i + 1).at(j))
        continue;
      ll nj = j + A.at(i);
      if (nj <= K)
        dp2.at(i).at(nj) = true;
      dp2.at(i).at(j) = true;
    }
  }

  if (!dp1.at(N).at(K))
    FINALANS(-1);

  vector<bool> need(N, true);
  for (ll i = 0; i < N; i++)
  {
    for (ll j = 0; j <= K; j++)
    {
      ll j2 = K - j;
      if (dp1.at(i).at(j) && dp2.at(i + 1).at(j2))
        need.at(i) = false;
    }
  }
  ll ans = count(need.begin(), need.end(), true);
  cout << ans << endl;

  //printvec(need);
}