#include <bits/stdc++.h>
int dr[] = {2, 2, -2, -2, 1, -1, 1, -1};
int dc[] = {1, -1, 1, -1, 2, 2, -2, -2};
int dr1[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int dc1[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
int dr2[] = {0, 0, 1, -1};
int dc2[] = {1, -1, 0, 0};
using namespace std;
long long int fr[26], a[26];
long long int bigmod(long long int n, long long int p) {
  if (p == 0) return 1;
  long long int x = bigmod(n, p / 2);
  x = (x * x) % 1000000007;
  if (p % 2 == 1) x = (x * n) % 1000000007;
  return x;
}
void pre() {
  long long int m = 1;
  long long int i, j;
  fr[0] = bigmod(m, 1000000007 - 2);
  for (i = 1; i <= 20; i++) {
    m *= i;
    m %= 1000000007;
    fr[i] = bigmod(m, 1000000007 - 2);
  }
}
long long int ncr(long long int n, long long int r) {
  long long int m = 1, i;
  for (i = n - r + 1; i <= n; i++) {
    long long int x = i % 1000000007;
    m = (m * x) % 1000000007;
  }
  m *= fr[r];
  m %= 1000000007;
  return m;
}
int main() {
  long long int n, s, i, j;
  pre();
  while (cin >> n >> s) {
    for (i = 0; i < n; i++) cin >> a[i];
    long long int m = (1 << n);
    long long int ans = 0;
    for (i = 1; i < m; i++) {
      long long int s1 = s;
      for (j = 0; j < n; j++) {
        long long int p = i & (1 << j);
        if (p == 0) continue;
        s1 -= (a[j] + 1);
      }
      if (s1 < 0) continue;
      long long int nr = ncr(n + s1 - 1, n - 1);
      if (__builtin_popcount(i) % 2 == 1)
        ans += nr;
      else
        ans -= nr;
      ans = (ans + 1000000007) % 1000000007;
    }
    cout << (ncr(n + s - 1, n - 1) - ans + 1000000007) % 1000000007 << endl;
  }
  return 0;
}
