#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

int a[210];

const ll mod=1000000007;
ll dp[210][10010];

int main(void){
	int n,w;
	cin >> n >> w;
	rep(i,n) cin >> a[i];
	sort(a,a+n);
	dp[n][0]=1;
	//  (dp[w-w1],dp[w] ]
	//  (dp[w-w2],dp[w-w1] ]  w1 is need = (dp[w-w2-w1],dp[w-w1-w1] ]
	for(int i=n;i>0;--i)rep(j,w+1){
		dp[i-1][j]+=dp[i][j],dp[i-1][j]%=mod;
		if(j+a[i-1]<=w) dp[i-1][j+a[i-1]]+=dp[i][j],dp[i-1][j+a[i-1]]%=mod;
	}
	rep(i,n) rep(j,w) dp[i][j+1]+=dp[i][j];

	ll ans=0,sum=0,cur=0,prev=0;
	rep(i,n){
		prev=cur,cur=a[i];
		if(w-prev-sum>=0) ans+=dp[i][w-prev-sum];
		if(w-cur-sum>=0) ans-=dp[i][w-cur-sum];
		ans+=mod,ans%=mod;
		sum+=a[i];
	}
	cout << ans << endl;
	return 0;
}