#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(),(X).end()

template <typename T>
T gcd(T a, T b) {
    return (a == 0) ? b : gcd(b%a, a);
}
template <typename T>
T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec){
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec;
}

inline ll popcnt(ll x){return __builtin_popcountll((unsigned long long)x);};
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }




int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll N, K; cin >> N >> K;
    vl A(N); rep(i, N) cin >> A[i]; sort(ALL(A));
   
    ll KK = K+10;
    vvb dpl(N+1, vb(KK, false)); rep(i, N+1) dpl[i][0] = true;
    for (ll i = N-1; i >= 0; i--) {
        rep(k, KK){
            if(dpl[i+1][k] && k+A[i] < KK){
                dpl[i][k+A[i]] = true;
            }
            dpl[i][k] = dpl[i][k] || dpl[i+1][k];
        }
    }
    
    auto AA = A; reverse(ALL(AA));
    vvb dpr(N+1, vb(KK, false)); rep(i, N+1) dpr[i][0] = true;
    for (ll i = N-1; i >= 0; i--) {
        rep(k, KK){
            if(dpr[i+1][k] && k+AA[i] < KK){
                dpr[i][k+AA[i]] = true;
            }
            dpr[i][k] = dpr[i][k] || dpr[i+1][k];
        }
    }
    
    ll ans = 0;
    ll unmn = -1;
    rep(i, N){
        if(A[i] >= K) continue;
        if(A[i] <= unmn){
            ans++; continue;
        }
        
        ll j = N-i-1;
        set<ll> ls, rs;
        rep(k, KK){
            if(dpr[j+1][k]) rs.insert(k);
        }
        ll mxr = *rs.rbegin();
         rs.insert(LINF);
        
        bool ok = true;
        rep(l, KK){
            if(!dpl[i+1][l]) continue;
            if(mxr < K - A[i] - l) continue;
            auto it = rs.lower_bound(K-A[i]-l);
            if(*it+l < K){
                ok = false; break;
            }
        }
        if(ok){
            ans++; chmax(unmn, A[i]);
        }
    }
    
    cout << ans << endstr;
    return 0;
}


Measured memory_bytes: 7168