#AT13. Candies

Candies

Original Problem Statement (English)

Source: AtCoder Educational DP Contest - Problem M

Problem Statement

There are NN children, numbered 1,2,…,N1, 2, \ldots, N.

They have decided to share KK candies among themselves. Here, for each ii (1≤i≤N1 \leq i \leq N), Child ii must receive between 00 and aia_i candies (inclusive). Also, no candies should be left over.

Find the number of ways for them to share candies, modulo 109+710^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≤N≤1001 \leq N \leq 100
  • 0≤K≤1050 \leq K \leq 10^5
  • 0≤ai≤K0 \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 109+710^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, 1, 3)
  • (0,2,2)(0, 2, 2)
  • (1,0,3)(1, 0, 3)
  • (1,1,2)(1, 1, 2)
  • (1,2,1)(1, 2, 1)

Here, in each sequence, the ii-th element represents the number of candies that Child ii 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)(0, 0)

Sample Input 4

4 100000
100000 100000 100000 100000

Sample Output 4

665683269

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