Problem: Devu wants to decorate his garden with flowers. He has purchased n boxes, where the i-th box contains fi 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 (109 + 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 ≤ 1014).

The second line contains n space-separated integers f1, f2, ... fn (0 ≤ fi ≤ 1012).

Output

Output a single integer — the number of ways in which Devu can select the flowers modulo (109 + 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}.

Solution (in JAVA):

Solution:
import java.util.*;

public class devuflowers {

	public static long MOD = 1000000007L;

	public static long[] modInv;

	public static void main(String[] args) {

		modInv = new long[21];
		modInv[1] = 1;
		for (int i=2; i<=20; i++)
			modInv[i] = fastModExpo(i, MOD-2);

		// Get n and s.
		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();
		long sum = stdin.nextLong();

		// Read in each individual value.
		long[] vals = new long[n];
		long total = 0;
		for (int i=0; i<n; i++) {
			vals[i] = stdin.nextLong();
			total += vals[i];
		}

		// Screen out this case.
		if (total < sum)
			System.out.println(0);

		// Do real work here.
		else {

			// Store subset sums here.
			long[] subsumplusone = new long[1<<n];

			long res = 0;

			// Run I/E here.
			for (int i=0; i<(1<<n); i++) {

				// Set up sign for I/E.
				int sign = Integer.bitCount(i)%2 == 0 ? 1 : -1;

				// Set the sum of this subset.
				if (i > 0) {
					int loc = 0;
					while ((i & (1<<loc)) == 0) loc++;
					subsumplusone[i] = subsumplusone[i-(1<<loc)] + vals[loc] + 1;
				}

				// Add in term.
				res = (res + sign*choosewithrep(sum-subsumplusone[i], n) + MOD)%MOD;
			}

			System.out.println(res);
		}
	}

	// Returns n+k-1 choose k-1.
	public static long choosewithrep(long n, int k) {

		if (n < 0) return 0;

		// Numerator.
		long res = 1;
		for (int i=1; i<k; i++)
			res = (res * ((n+k-i)%MOD))%MOD;

		for (int i=2; i<=k-1; i++)
			res = (res*modInv[i])%MOD;

		return res;
	}

	public static long fastModExpo(long base, long exp) {
		if (exp == 0) return 1L;
		if (exp%2 == 0) {
			long tmp = fastModExpo(base, exp/2);
			return (tmp*tmp)%MOD;
		}
		return (fastModExpo(base, exp-1)*base)%MOD;
	}
}