Problem:
Score : 100 points

Problem Statement

There are N children, numbered 1, 2, \ldots, N.

They have decided to share K candies among themselves.
Here, for each i (1 \leq i \leq N), Child i must receive between 0 and a_i candies (inclusive).
Also, no candies should be left over.

Find the number of ways for them to share candies, modulo 10^9 + 7.
Here, two ways are said to be different when there exists a child who receives a different number of candies.

Constraints

All values in input are integers.

1 \leq N \leq 100

0 \leq K \leq 10^5

0 \leq a_i \leq K

Input

Input is given from Standard Input in the following format:

N K
a_1 a_2 \ldots a_N

Output

Print the number of ways for the children to share candies, modulo 10^9 + 7.

Sample Input 1

3 4
1 2 3

Sample Output 1

5

There are five ways for the children to share candies, as follows:

(0, 1, 3)

(0, 2, 2)

(1, 0, 3)

(1, 1, 2)

(1, 2, 1)

Here, in each sequence, the i-th element represents the number of candies that Child i receives.

Sample Input 2

1 10
9

Sample Output 2

0

There may be no ways for the children to share candies.

Sample Input 3

2 0
0 0

Sample Output 3

1

There is one way for the children to share candies, as follows:

(0, 0)

Sample Input 4

4 100000
100000 100000 100000 100000

Sample Output 4

665683269

Be sure to print the answer modulo 10^9 + 7.

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

'use strict'

const mod = 1e9 +7

function solve(N, K, A) {
  if (K === 0) {
    return 1
  }
  if (N === 1) {
    return 0
  }
  var prefixSum = []
  for (var i = 0; i <= K; i++) {
    if (A[N-1] >= i) {
      if (!prefixSum.length) {
        prefixSum.push(1)
      } else {
        prefixSum.push(prefixSum[prefixSum.length - 1] + 1)
      }
    } else {
      if (!prefixSum.length) {
        prefixSum.push(0)
      } else {
        prefixSum.push(prefixSum[prefixSum.length - 1])
      }
    }
  }
  var newPrefix = new Array(K+1).fill(0)
  for (var i = N - 2; i > 0; i--) {
    for (var j = 0; j <= K; j++) {
      if (j <= A[i]) {
        newPrefix[j] = j > 0 ? (prefixSum[j] + newPrefix[j-1]) % mod : prefixSum[j] % mod
      } else {
        newPrefix[j] = j > 0 ? (newPrefix[j-1] + prefixSum[j] - prefixSum[j - A[i] - 1]) % mod : (prefixSum[j] - prefixSum[j - A[i] - 1]) % mod
      }
    }
    prefixSum = newPrefix
  }
  var ans = 0
  if (K <= A[0]) {
    ans = prefixSum[K] % mod
  } else {
    ans = (prefixSum[K] - prefixSum[K - A[0] - 1]) % mod
  }
  return ans
}

function main(input) {
  var lines = input.split("\n")
  var NK = lines[0].split(' ').map(l => parseInt(l))
  var N = NK[0]
  var K = NK[1]
  var A = lines[1].split(' ').map(l => parseInt(l))
  var ans = solve(N, K, A)
  console.log(ans)
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));