#include<iostream>
#include<vector>
#include<algorithm>
#define int long long
using namespace std;

int n,m;
int a[105];
const int mod=1e6+7;
int ans;
bool rmb[105][105];

void dfs(int step,int flowers){
    if(flowers>m) return;
    if(flowers==m){
        ans++; ans%=mod; return;
    }
    for(int i=step;i<=n;i++){
        for(int j=1;j<=a[i];j++){
            dfs(i+1,flowers+j);
        }
    }
    return;
}

signed main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    dfs(1,0);
    cout<<ans%mod<<endl;
    return 0;
}