#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }
inline void YesNo(bool f) { std::cout << (f? "Yes": "No") << std::endl; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

int dp[10001][1001];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    cin >> a;
    dp[0][0] = 1;
    rep(i, n){
        rep(j, k + 1){
            dp[i + 1][j] |= dp[i][j];
            if (j + a[i] <= k) dp[i + 1][j + a[i]] |= dp[i][j];
        }
    }
    if (dp[n][k] == 0){
        cout << -1 << endl;
        return 0;
    }
    vector<int> a1(n), a2(n);
    int now = n - 1;
    int c = k;
    while (now >= 0){
        if (c - a[now] >= 0 && dp[now][c - a[now]] == 1){
            a1[now] = 1;
            c -= a[now];
        }
        now--;
    }
    now = n - 1;
    c = k;
    while (now >= 0){
        if (dp[now][c] != 1){
            a2[now] = 1;
            c -= a[now];
        }
        now--;
    }
    set<int> s;
    rep(i, n) if (a1[i] & a2[i]) s.insert(a[i]);
    cout << s.size() << endl;
}