#include <iostream>
using namespace std;
const int N = 110, mol = 1e6 + 7;
int f[N][N];
int n, m;
int a[N];
int main()
{
  cin >> n >> m;
  for (int i = 1; i <= n; i ++ ) cin >> a[i];
  for (int i = 0; i <= n; i ++ ) f[i][0] = 1;
  for (int i = 1; i <= n; i ++ ) 
    for (int j = 1; j <= m; j ++ ) 
      for (int k = j; k >= max(j - a[i], 0); k -- )
        f[i][j] = (f[i][j] + f[i - 1][k]) % mol;
  cout << f[n][m] << endl;
  return 0;
}