#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

const int N = 10001;
bitset<N> dp;
bitset<N> memo;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k; cin >> n >> k;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }    
    dp[0] = 1;
    for(int i=0;i<n;i++){
        dp |= (dp<<a[i]);
    }
    if(!dp[k]){
        cout << -1 << endl;
        return 0;
    }
    memo[0] = 1;
    int res = 0;
    for(int i=0;i<a.size();i++){
        dp &= 0;
        dp |= memo;
        for(int j=i+1;j<a.size();j++){
            dp |= (dp << a[j]);
            if(dp[k])break;
        }
        if(!dp[k])res++;
        memo |= (memo << a[i]);
    }
    cout << res << endl;
}