// https://atcoder.jp/contests/abc056/tasks/arc070_b
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

fn doit(a: &Vec<usize>, k: usize) -> Vec<Vec<i32>> {
    let n = a.len();
    let mut dp = dvec!(0; n+1, k+10);
    dp[0][0] = 1;
    for i in 1..n+1 {
        for j in 0..k+10 {
            dp[i][j] = dp[i-1][j];
        }
        let add = a[i-1];
        for j in 0..k+10 {
            if j >= add {
                dp[i][j] = max(dp[i][j], dp[i-1][j-add]);
            }
        }
    }
    dp
}

fn main() {
    input! {
        n: usize, k: usize,
        mut a: [usize; n]
    };

    let mut noneed = 0;

    let mut left = doit(&a, k); // table of 0-1
    a.reverse();
    let mut right = doit(&a, k);
    a.reverse();

    for i in 0..n+1 {
        for j in (1..k+10).rev() {
            right[i][j] = right[i][j-1];
        }
        right[i][0] = 0;
        for j in 1..k+10 {
            right[i][j] += right[i][j-1];
        }
    }

    for i in 0..n {
        if a[i] >= k {
            continue;
        }

        // do we have subset of cards without i which sum is k-a[i] to k-1?
        // left[i] and right[n-i-1]
        let mut isneed = false;
        for l in 0..k {
            // right: k-a[i]-l to k-1-l

            let f = ifv!(k >= a[i]+l, k-a[i]-l, 0);
            let t = k-l;
            isneed |= left[i][l] >= 1 && right[n-i-1][t] - right[n-i-1][f] >= 1;
        }
        if !isneed {
            noneed += 1;
        }
    }
    println!("{}", noneed);
}


Measured memory_bytes: 250108