/*
ID: Aman Raj
LANG: C++
TASK: preface
*/
#include<iostream>
#include <stdio.h>
//#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#include<math.h>
typedef  long long int ll;
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

using namespace std;
using namespace __gnu_pbds;

#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
//#define ll long long
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (1000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000*1000*1000+7)
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
//#define flush fflush(stdout)
#define primeDEN 727999983
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#include <fstream>
// find_by_order()  // order_of_key
typedef tree<
	int,
	null_type,
	less<int>,
	rb_tree_tag,
	tree_order_statistics_node_update>
	ordered_set;
  //# define mod 1e9+7

int main()
{   ll n,k;cin>>n>>k;
     vector<ll> v(n);
       for(ll i=0;i<n;i++)cin>>v[i];
       //dp[i][j] will represent ways yo distribure j among i
         vector<vector<ll> > dp(n+1,vector<ll>(k+1,0));
          //for(ll j=1;j<=v[0];j++)dp[0][j]=1;
       dp[0][0]=1;
       sort(all(v));
    for(ll i=1;i<=n;i++)
    {  dp[i][0]=1;
        for(ll j=1;j<=k;j++)
        {
              dp[i][j]=dp[i-1][j];
               dp[i][j]+=dp[i][j-1];
               if(dp[i][j]>=mod)dp[i][j]%=mod;

        }ll s=0;
        for(ll j=1;j<=k;j++)
        {if(j>v[i-1]){s+=dp[i-1][j-v[i-1]-1];dp[i][j]-=s;}
        }
    }
    /*for(ll i=0;i<=n;i++)
    {
        for(auto x:dp[i])cout<<x<<" ";
        cout<<endl;
    }*/

  cout<<dp[n][k];
	return 0;

}
