#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}
template<class T> T pow(T x, ll y){if (y == 0) return 1;T p = pow(x,y/2);if (y%2 == 0) return p*p;else return p*p*x;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,k; cin >> n >> k;
    vector<int> A(n);
    rep(i,n) cin >> A[i];
    vector<vector<bool>> dp(n+1,vector<bool>(k+1)), pd(n+1,vector<bool>(k+1));
    dp[0][0] = true;
    rep(i,n){
        rrep(j,k+1){
            dp[i+1][j] = dp[i][j];
            if (j+A[i] <= k) dp[i+1][j+A[i]] = dp[i+1][j+A[i]] || dp[i][j];
        }
    }
    pd[n][0] = true;
    rrep(i,n){
        rrep(j,k+1){
            pd[i][j] = pd[i+1][j];
            if (j+A[i] <= k) pd[i][j+A[i]] = pd[i][j+A[i]] || pd[i+1][j];
        }
    }
    if (!dp[n][k]){
        cout << -1 << endl;
        return 0;
    }
    int ans = n;
    rep(i,n){
        rep(j,k+1){
            if (dp[i][j] && pd[i+1][k-j]){
                ans--;
                break;
            }
        }
    }
    cout << ans << endl;
}