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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long sum = 0, n, m;
const long long mod = 1e9 + 7;
long long f[25];
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ans;
}
long long getc(long long a, long long b) {
  if (a < b) return 0;
  if (b > a - b) b = a - b;
  long long s1 = 1, s2 = 1;
  for (long long i = 0; i < b; i++) {
    s1 = s1 * (a - i) % mod;
    s2 = s2 * (i + 1) % mod;
  }
  return s1 * qpow(s2, mod - 2) % mod;
}
long long lucas(long long n, long long k) {
  if (k == 0) return 1;
  return getc(n % mod, k % mod) * lucas(n / mod, k / mod) % mod;
}
long long solve() {
  long long ans = 0;
  for (int i = 0; i < (1 << n); i++) {
    long long cnt = 0, sum = m;
    for (int j = 0; j < n; j++) {
      if (i & (1 << j)) {
        sum -= f[j] + 1;
        cnt++;
      }
    }
    if (sum < 0) continue;
    if (cnt & 1)
      ans -= lucas(sum + n - 1, n - 1);
    else
      ans += lucas(sum + n - 1, n - 1);
    ans %= mod;
  }
  return (ans + mod) % mod;
}
int main() {
  scanf("%lld%lld", &n, &m);
  for (int i = 0; i < n; i++) scanf("%lld", &f[i]);
  printf("%lld\n", solve());
  return 0;
}