#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

bool dpl[10001][1001];
bool dpr[10001][1001];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    dpl[0][0] = true;
    for(int i = 0; i < n; i++){
        for(int j = 0; j <= k; j++){
            if(dpl[i][j]){
                dpl[i+1][j] = true;
                if(j+a[i] <= k) dpl[i+1][j+a[i]] = true;
            }
        }
    }
    dpr[n][0] = true;
    for(int i = n-1; i >= 0; i--){
        for(int j = 0; j <= k; j++){
            if(dpr[i+1][j]){
                dpr[i][j] = true;
                if(j+a[i] <= k) dpr[i][j+a[i]] = true;
            }
        }
    }
    if(!dpl[n][k]){
        cout << -1 << endl;
        return 0;
    }
    int ans = 0;
    for(int i = 0; i < n; i++){
        bool ok = false;
        for(int j = 0; j <= k; j++){
            if(dpl[i][j] && dpr[i+1][k-j]) {
                ok = true;
            }
        }
        if(!ok) ans++;
    }
    cout << ans << endl;
}