#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){if(a < b) a = b;}
template <class T> inline void chmin(T &a, T b){if(a > b) a = b;}
template <class T> inline void reverseSORT(Vec<T> &Array){
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1LL << k;}
inline void putsDouble(double d){printf("%.16lf\n", d);}
inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res;
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


void printdata(Wbool &A, int n, int k, char *a){
    puts(a);
    for(int i = 0; i < n; ++i){
        putchar(' '); putchar(' ');
        for(int j = 0; j < k; ++j){
            printf("%d", A[i][j] ? 1 : 0);
        }
        putchar('\n');
    }
}


int main(void){
    int n, k; scanf("%d%d", &n, &k);
    Vint A(n); REP(i, n) scanf("%d", &A[i]);
    // カード j が 不要か
    //          => k - A_i ≤ ∑_{i ∈ S} A_i < k となる S が取れるか
    // DP[i][S] = i枚目　まで使用して, 和を S にできるか
    // DP[i][S] ~> [0, i), rDP[i] ~> [0, i)^c
    // rDP ; 逆
    Wbool DP(n + 1, Vbool(k, false)),
         rDP(n + 1, Vbool(k, false));
    DP[0][0] = true; rDP[n][0] = true;
    for(int i = 0; i < n; ++i){
        const int nextI = i + 1;
        int j;
        for(j = 0; j < k - A[i]; ++j){
            if(DP[i][j]){
                DP[nextI][j] = true;
                DP[nextI][j + A[i]] = true;
            }
        }
        for(; j < k; ++j) if(DP[i][j]) DP[nextI][j] = DP[i][j];
    }
    for(int i = n - 1; i >= 0; --i){
        const int preI = i + 1;
        int j;
        for(j = 0; j < k - A[i]; ++j){
            if(rDP[preI][j]){
                rDP[i][j] = true;
                rDP[i][j + A[i]] = true;
            }
        }
        for(; j < k; ++j) if(rDP[preI][j]) rDP[i][j] = rDP[preI][j];
    }
    int cnt = n; Vint counter(k);
    for(int i = 0; i < n; ++i){
        // 0で初期化
        for(int j = 0; j < k; ++j) counter.at(j) = 0;
        for(int j = 0; j < k; ++j){
            if(DP[i][j]){
                // k - A[i] - j ~ k - A[i] に + 1
                //printf("+ : %d, - : %d \n", max(k - A[i] - j, 0), k - j);
                counter.at(max(k - A[i] - j, 0))++;
                if(j != 0) counter.at(k - j)--;
            }
        }
        for(int j = 1; j < k; ++j) counter.at(j) += counter.at(j-1);
        //printf("%d : ", i); for(int j = 0; j < k; ++j) printf("%d ", counter.at(j)); putchar('\n');
        for(int j = 0; j < k; ++j) if(rDP[i+1][j] and counter[j] > 0){
            //printf("bad = %d\n", i);
            cnt--;
            break;
        }
    }
    printf("%d\n", cnt);
    return 0;
}

Measured memory_bytes: 6784