// tsutaj's solution
// Expected Status: Accepted

#include <cstdio>
#include <algorithm>
int a[310], dp[310][45000];
const int MOD = 1000000007;
int main() {
    int N, K; scanf("%d%d", &N, &K);
    for(int i=0; i<N; i++) {
        scanf("%d", &a[i]);
    }

    for(int i=0; i<=K; i++) dp[0][i] = 1;
    for(int i=0; i<N; i++) {
        for(int j=0; j<=K; j++) {
            int lb = j-i-1, ub = j;
            if(lb < 0) (dp[i+1][j] += dp[i][j]) %= MOD;
            else (dp[i+1][j] += (dp[i][ub] - dp[i][lb] + MOD)) %= MOD;

            if(j != 0) (dp[i+1][j] += dp[i+1][j-1]) %= MOD;
        }
    }

    int ans = dp[N][K];
    printf("%d\n", ans);
    return 0;
}