Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Devu and Flowers

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDevu wants to decorate his garden with flowers. He has purchased *n* boxes, where the *i*-th box contains *f*_{i} flowers. All flowers in a single box are of the same color (hence they are indistinguishable). Also, no two boxes have flowers of the same color.

Now Devu wants to select exactly *s* flowers from the boxes to decorate his garden. Devu would like to know, in how many different ways can he select the flowers from each box? Since this number may be very large, he asks you to find the number modulo (10^{9} + 7).

Devu considers two ways different if there is at least one box from which different number of flowers are selected in these two ways.

Input

The first line of input contains two space-separated integers *n* and *s* (1 ≤ *n* ≤ 20, 0 ≤ *s* ≤ 10^{14}).

The second line contains *n* space-separated integers *f*_{1}, *f*_{2}, ... *f*_{n} (0 ≤ *f*_{i} ≤ 10^{12}).

Output

Output a single integer — the number of ways in which Devu can select the flowers modulo (10^{9} + 7).

Examples

Input

2 3

1 3

Output

2

Input

2 4

2 2

Output

1

Input

3 5

1 3 2

Output

3

Note

Sample 1. There are two ways of selecting 3 flowers: {1, 2} and {0, 3}.

Sample 2. There is only one way of selecting 4 flowers: {2, 2}.

Sample 3. There are three ways of selecting 5 flowers: {1, 2, 2}, {0, 3, 2}, and {1, 3, 1}.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/27/2021 01:19:21 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|