#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int K = 1000;
  int n, k; cin >> n >> k;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<bitset<K + 1>> l(n + 1, 0), r(n + 1, 0);
  l[0].set(0);
  REP(i, n) l[i + 1] = l[i] | (l[i] << a[i]);
  r[n].set(0);
  for (int i = n - 1; i >= 0; --i) r[i] = r[i + 1] | (r[i + 1] << a[i]);
  if (!l[n][k]) {
    cout << "-1\n";
    return 0;
  }
  int ans = 0;
  REP(i, n) {
    bool flag = true;
    REP(j, k + 1) flag &= !l[i][j] || !r[i + 1][k - j];
    ans += flag;
  }
  cout << ans << '\n';
  return 0;
}