#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double inf = ~0u >> 2;
long long a[22], inv[22];
long long getInv(long long x) {
  long long ret = 1;
  x %= 1000000007;
  for (int a = 1000000007 - 2; a; a /= 2, x = x * x % 1000000007)
    if (a % 2 == 1) ret = ret * x % 1000000007;
  return ret;
}
int C(long long n, int m) {
  if (n < m) return 0;
  int ret = 1;
  for (long long i = n; i > n - m; --i)
    ret = ret * (i % 1000000007) % 1000000007 * inv[n - i + 1] % 1000000007;
  return ret;
}
int main() {
  int n, i, j;
  long long s;
  for (i = 0; i <= 20; i++) inv[i] = getInv(i);
  cin >> n >> s;
  for (i = 0; i < n; i++) cin >> a[i];
  long long ans = C(s + n - 1, n - 1);
  for (i = 1; i < (1 << n); i++) {
    long long ss = s;
    int o = 0;
    for (j = 0; j < n; j++)
      if (i & (1 << j)) {
        ss -= (a[j] + 1);
        o++;
      }
    if (ss < 0) continue;
    if (o & 1)
      ans -= C(ss + n - 1, n - 1);
    else
      ans += C(ss + n - 1, n - 1);
    ans = (ans % 1000000007 + 1000000007) % 1000000007;
  }
  cout << ans << endl;
  return 0;
}
