/**
*    author:  shu8Cream
*    created: 22.03.2022 12:51:53
**/

#include <bits/stdc++.h>
using namespace std;
#define overload3(a,b,c,d,...) d
#define rep1(i,n) for (int i=0; i<(n); i++)
#define rep2(i,a,n) for (int i=(a); i<(n); i++)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define rrep1(i,n) for (int i=(n-1); i>=0; i--)
#define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--)
#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
const ll INF = 8e18;

template<class T> inline bool chmax(T& a, T b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) { a = b; return true; }
    return false;
}

template <class T> string to_string(T s);
template <class S, class T> string to_string(pair<S, T> p);
string to_string(char c) { return string(1, c); }
string to_string(string s) { return s; }
string to_string(const char s[]) { return string(s); }

template <class T>
string to_string(T v) {
    if (v.empty()) return "{}";
    string ret = "{";
    for (auto x : v) ret += to_string(x) + ",";
    ret.back() = '}';
    return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
    return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";
}

void debug_out() { cout << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cout << to_string(H) << " ";
    debug_out(T...);
}

#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

ll dpl[10010][1010];
ll dpr[10010][1010];


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,k; cin >> n >> k;
    vi a(n); rep(i,n) cin >> a[i];
    dpl[0][0] = 1;
    dpr[0][0] = 1;
    rep(i,n)rep(j,k+1){
        dpl[i+1][j] += dpl[i][j];
        if(j+a[i]>k) continue;
        dpl[i+1][j+a[i]] += dpl[i][j];
    }
    rrep(i,n)rep(j,k+1){
        dpr[n-i][j] += dpr[n-1-i][j];
        if(j+a[i]>k) continue;
        dpr[n-i][j+a[i]] += dpr[n-1-i][j];
    }
    if(dpr[n][k]==0){
        cout << -1 << endl;
        return 0;
    }
    int ans = n;
    rep(i,1,n+1){
        bool f = false;
        rep(j,k+1)
            if(dpl[i-1][j] && dpr[i+1][k-j])
                f = true;
        if(f) ans--;
    }
    cout << ans << endl;
}