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.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class e {
	static final long MOD = (long)1e9+7;
	public static void main(String[] args) {
		long[] invs = new long[300];
		invs[1] = 1;
		for (int i = 2; i < invs.length; ++i)
			invs[i] = (MOD - (MOD / i) * invs[((int) (MOD % i))] % MOD) % MOD;

		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		long s = in.nextLong();
		long[] fs = new long[n];
		for(int i=0;i<n;i++)
			fs[i] = in.nextLong();
		ArrayList<Term> ans = new ArrayList<>();
		ans.add(new Term(1, 0));
		for(int i=0;i<n;i++) {
			ArrayList<Term> cur = new ArrayList<>();
			cur.add(new Term(1,0));
			cur.add(new Term(-1,fs[i]+1));
			ans = multiply(ans, cur);
		}
		Collections.sort(ans);
//		System.out.println(ans);
		long sum = 0;
		for(Term t : ans) {
			long pow = s - t.pow;
			if(pow < 0) continue;
			long choose = 1;
			for(int i=0;i<n-1;i++) {
				choose *= (pow+n-1-i) % MOD;
				choose %= MOD;
				choose *= invs[i+1];
				choose %= MOD;
//				System.out.println(" * " + (pow-i) + " / " + (i+1));
			}
//			System.out.println("(" + (pow+n-1) + " choose " + (n-1) + ") = " + choose);
			sum += t.c * choose;
			sum %= MOD;
		}
		if(sum < 0) sum += MOD;
		System.out.println(sum);
	}
	static ArrayList<Term> multiply(ArrayList<Term> eq1, ArrayList<Term> eq2) {
		ArrayList<Term> ans = new ArrayList<>();
		for(Term t1 : eq1) {
			for(Term t2 : eq2) {
				ans.add(new Term((t1.c * t2.c) % MOD, t1.pow + t2.pow));
			}
		}
		return ans;
	}
	static class Term implements Comparable<Term>{
		long c;
		long pow;
		public Term(long c, long pow) {
			this.c = c;
			this.pow = pow;
		}
		@Override
		public int compareTo(Term o) {
			return Long.compare(pow, o.pow);
		}
		@Override
		public String toString() {
			return c + "x^(" + pow + ")";
		}
	}
}