const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void pt(){cout << endl; return;}
template<class Head> void pt(Head&& head){cout << head; pt(); return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
void dpt(){if(!isDebugMode) return; cout << endl; return;}
template<class Head> void dpt(Head&& head){if(!isDebugMode) return; cout << head; pt(); return;}
template<class Head, class... Tail> void dpt(Head&& head, Tail&&... tail){if(!isDebugMode) return; cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){if(!isDebugMode) return; rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){if(!isDebugMode) return; rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2> long long recgcd(T1 a, T2 b){return a % b ? recgcd(b , a % b) : b;}
bool valid(long long H, long long W, long long h, long long w) { return 0 <= h && h < H && 0 <= w && w < W; }

int main(){
    ll N, K; cin >> N >> K;
    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    vector<vector<bool>> dp0(N + 2, vector<bool>(K + 1, false));
    vector<vector<bool>> dp1(N + 2, vector<bool>(K + 1, false));
    dp0[0][0] = true;
    dp1[N + 1][0] = true;
    rep(i, N){
        rep(j, K){
            if(dp0[i][j]) dp0[i + 1][j] = true;
            if (j + a[i] <= K && dp0[i][j]) dp0[i + 1][j + a[i]] = true;
        }
    }

    for(ll i = N + 1; i >= 2; i--){
        rep(j, K){
            if(dp1[i][j]) dp1[i - 1][j] = true;
            if(j + a[i - 2] <= K && dp1[i][j]) dp1[i - 1][j + a[i - 2]] = true;
        }
    }
    ll ans = 0;
    rep(i, N){
        vector<ll> lef;
        vector<ll> rig;
        rep(j, K){
            if(dp0[i][j]) lef.push_back(j);
            if(dp1[i + 2][j]) rig.push_back(j);
        }
        for(auto& e : lef){
            auto it = lower_bound(all(rig), K - a[i] - e);
            if(it == rig.end()) continue;
            if(*it < K - e){
                ++ans;
                break;
            }
        }
    }
    pt(N - ans);
    return 0;
}

Measured memory_bytes: 10216