#include <bits/stdc++.h>
            #include<iostream>
            #include<cstdio>
            #include<vector>
            #include<queue>
            #include<map>
            #include<cstring>
            #include<string>
            #include <math.h>
            #include<algorithm>
        //    #include <boost/multiprecision/cpp_int.hpp>
            #include<functional>
     #define int long long
            #define mod  1000000009
            #define pa pair<int,int>
            #define ll long long
            #define pal pair<double,int>
            #define ppa pair<int,pa>
            #define ssa pair<string,int>
            #define  mp make_pair
            #define  pb push_back
            #define EPS (1e-10)
            #define equals(a,b) (fabs((a)-(b))<EPS)
     
            using namespace std;
     //priority_queue<int, vector<int>, greater<int> > que;
            class Point{
            	public:
            	double x,y;
            	Point(double x=0,double y=0):x(x),y(y) {}
            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
            	Point operator * (double a) {return Point(x*a,y*a);}
            	Point operator / (double a) {return Point(x/a,y/a);}
            	double absv() {return sqrt(norm());}
            	double norm() {return x*x+y*y;}
            	bool operator < (const Point &p) const{
            		return x != p.x ? x<p.x: y<p.y;
            	}
            	bool operator == (const Point &p) const{
            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
            	}
            };
            typedef Point Vector;
     
            struct Segment{
            Point p1,p2;
            };
     
        double hen(Vector a){
        if(fabs(a.x)<EPS && a.y>0) return acos(0);
        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
        else if(a.y>0) return acos(a.x/a.absv());
        else return 2*acos(0)+acos(-a.x/a.absv());
     
        }
     
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}

int gcd(int v,int b){
	if(v>b) return gcd(b,v);
	if(v==b) return b;
	if(b%v==0) return v;
	return gcd(v,b%v);
}
            double dot(Vector a,Vector b){
            	return a.x*b.x+a.y*b.y;
            }
            double cross(Vector a,Vector b){
            	return a.x*b.y-a.y*b.x;
            }
        
double distans(double x1,double y1,double x2,double y2){
	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
	return sqrt(rr);
	
}
            //----------------kokomade tenpure------------
int n;
int a[5010];
int d[5010];
int dp[5001][5010]={0};
//int sp[401][410]={0};
int mod2=mod+2;
    signed  main(){
 dp[0][0]=1;
    //	sp[0][0]=1;
    	int n,k;
    	cin>>n>>k;
    	
   // 	if(n>400 || k>400) return 0;
    	
    	for(int i=1;i<=n;i++) cin>>a[i];
    	
    	for(int i=1;i<=n;i++){
    		
    		for(int j=0;j<k;j++){
    			if(dp[i-1][j]==0) continue;
    			
    			dp[i][j] += dp[i-1][j];
    			dp[i][j] %= mod;
    			
    			if(j+a[i]>=k){
    				dp[i][k] += dp[i-1][j];
    				dp[i][k] %= mod;
    			}else{
    				dp[i][j+a[i]] += dp[i-1][j];
    				dp[i][j+a[i]] %= mod;
    			}
    			
    		}
    		dp[i][k] += 2*dp[i-1][k];
    		dp[i][k] %= mod;
    		
    	}
    	
   // 	for(int i=0;i<10;i++) cout<<dp[3][i]<<" ";
    	int ans=0;
    	
    	
    	for(int i=1;i<=n;i++){
    		for(int j=0;j<k;j++) d[j]=dp[n][j];
    		
    		for(int j=0;j<k;j++){
    			if(d[j]==0) continue;
    			
    			if(j+a[i]>=k) goto lll;
    			d[j+a[i]] -= d[j];
    			while(d[j+a[i]]<0) d[j+a[i]] += mod;
    			
    		}
    		ans++;
    		
    		
    		
    		lll:;
    	}
    	
    	cout<<ans<<endl;
  //  	printf("%.10f\n",ans[n-1]);
    	return 0;
    }

Measured memory_bytes: 195840