// ===== template.hpp =====
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

[[maybe_unused]] constexpr i32 inf = 1000000100;
[[maybe_unused]] constexpr i64 inf64 = 3000000000000000100;

struct SetIO {
    SetIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(10);
    }
} set_io;
// ===== template.hpp =====

#ifdef DEBUGF
#include  "../new_library/other/debug.hpp"
#else
#define DBG(x) (void) 0
#endif

constexpr i32 mx = 1000;

int main() {
    i32 n, k;
    cin >> n >> k;
    Vec<i32> a(n);
    REP(i, n) {
        cin >> a[i];
    }
    
    assert(n <= 10000);
    REP(i, n) {
        assert(a[i] <= mx);
    }
    
    Vec<bitset<mx + 1>> forw(n + 1), backw(n + 1);
    forw[0][0] = true;
    backw[n][0] = true;
    REP(i, n) {
        forw[i + 1] = forw[i] | (forw[i] << a[i]);
    }
    PER(i, n) {
        backw[i] = backw[i + 1] | (backw[i + 1] << a[i]);
    }
    
    if (!forw[n][k]) {
        cout << -1 << '\n';
        exit(0);
    }
    
    i32 ans = 0;
    REP(i, n) {
        bool need = true;
        REP(j, k + 1) {
            if (forw[i][j] && backw[i + 1][k - j]) {
                need = false;
            }
        }
        if (need) {
            ++ans;
        }
    }
    cout << ans << '\n';
}