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 b {
public static void main(String[] args)
{
	Scanner input = new Scanner(System.in);
	n = input.nextInt();
	s = input.nextLong();
	data = new long[n];
	invs = new long[21];
	for(int i = 1; i<=20; i++) invs[i] = invmod(i);
	for(int i = 0; i<n; i++) data[i] = input.nextLong();
	long res = 0;
	for(int i = 0; i<(1<<n); i++)
	{
		long cur = go(i);
		if(Integer.bitCount(i)%2 == 1) cur *= -1;
		res += cur;
		res %= mod;
	}
	System.out.println((res+mod)%mod);
}
static long[] invs;
static int n;
static long s;
static long[] data;
static long mod = (long)1e9+7;
static long go(int mask)
{
	long sum = s;
	for(int i = 0; i<n; i++)
	{
		if((mask & (1<<i)) > 0) sum -= 1 + data[i];
	}
	if(sum < 0) return 0;
	long num = sum + n - 1;
	long denom = n-1;
	long res = 1;
	for(int i = 0; i<denom; i++)
	{
		res = (res * ((num-i)%mod))%mod;
		res = (res * invs[i+1])%mod;
	}
	return res;
}
public static long[] gcd(long p, long q)
{
	if(q==0) return new long[] {p, 1, 0};
	long[] vals = gcd(q, p%q);
	return new long[] {vals[0], vals[2], vals[1] - (p/q)*vals[2]};
}
public static long invmod(long x)
{
	long[] vals = gcd(x, mod);
	if(vals[0]>1) return -1;
	if(vals[1]>0) return vals[1];
	return mod + vals[1];
}
}