#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug==
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-12;};
template<> inline long double EPS<long double>(){return 1e-12;};

// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

class Main{
	public:

	void run(){
		int N,K;cin >> N >> K;
		vector<ll> as(N);cin >> as;
		sort(ALL(as));
		{
			vector<ll> tas;
			for(int i:range(N))if(as[i] < K){
				tas.push_back(as[i]);
			}
			N = tas.size();
			as = tas;
		}


		vector<int> pat;
		{
			vector<vector<int>> dp(N+1,vector<int>(2*K+1));
			dp[0][0] = 1;
			for(int i:range(0,N)){
				for(int k:range(2*K+1)){
					dp[i+1][k] += dp[i][k];
					dp[i+1][k] %= (ll)(1e9+7);
					if(k-as[i] >= 0){
						dp[i+1][k] += dp[i][k-as[i]];
						dp[i+1][k] %= (ll)(1e9+7);
					}
				}
			}
			pat = dp[N];
		}

		// vector<ll> pat2;
		// {
		// 	vector<vector<ll>> dp2(N+1,vector<ll>(2*K+1));
		// 	dp2[0][0] = 1;
		// 	for(int i:range(0,N)){
		// 		for(int k:range(2*K+1)){
		// 			dp2[i+1][k] += dp2[i][k];
		// 			dp2[i+1][k] %= (ll)(1e9+9);
		// 			if(k-as[i] >= 0){
		// 				dp2[i+1][k] += dp2[i][k-as[i]];
		// 				dp2[i+1][k] %= (ll)(1e9+9);
		// 			}
		// 		}
		// 	}
		// 	pat2 = dp2[N];
		// }
		// cerr << pat << endl;

		int res = 0;
		for(int i:range(N)){
			vector<int> tdp = pat;
			// vector<ll> tdp2 = pat2;
			for(int k:range(2*K+1)){
				ll v = pat[k];
				if(k-as[i] >= 0) v -= tdp[k-as[i]];
				v += 1e9+7; v%= (ll)(1e9+7);
				tdp[k] = v;
			}
			// for(int k:range(2*K+1)){
			// 	ll v = pat2[k];
			// 	if(k-as[i] >= 0) v -= tdp2[k-as[i]];
			// 	v += 1e9+9; v%= (ll)(1e9+9);
			// 	tdp2[k] = v;
			// }
			//
			bool ok = true;
			for(int k:range(K-as[i],K)){
				ok &= tdp[k] == 0;
			}
			res += (ok);
		}
		cout << res << endl;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}


Measured memory_bytes: 195840