#include <bits/stdc++.h>
using namespace std;
const long long jly = 1000000007;
long long inv[100005];
bool f[100005];
inline int read() {
  int re = 0;
  char ch = getchar();
  while (ch < 48 || ch > 57) ch = getchar();
  while (ch > 47 && ch < 58) {
    re = (re << 3) + (re << 1) + (ch ^ 48);
    ch = getchar();
  }
  return re;
}
inline long long rlong() {
  long long re = 0;
  char ch = getchar();
  while (ch < 48 || ch > 57) ch = getchar();
  while (ch > 47 && ch < 58) {
    re = (re << 3) + (re << 1) + (ch ^ 48);
    ch = getchar();
  }
  return re;
}
inline long long mjly(long long x) {
  return x < 0 ? x + jly : (x < jly ? x : x - jly);
}
inline int ksm(int a, int b) {
  int r = 1;
  while (b) {
    if (b & 1) r = (long long)r * a % jly;
    a = (long long)a * a % jly;
    b >>= 1;
  }
  return r;
}
inline long long binom(long long n, int m) {
  if (n < m || m < 0) return 0;
  n %= jly;
  if ((!n) || (!m)) return 1;
  long long r = 1;
  for (int i = 0; i < m; ++i) r = r * (n - i) % jly;
  for (int i = 0; i <= m; ++i) r = r * inv[i] % jly;
  return r;
}
int main() {
  static long long f[25];
  inv[0] = inv[1] = 1;
  int n = read();
  long long s = rlong(), u, v, w;
  for (int i = 0; i < n; ++i) f[i] = rlong();
  for (int i = 2; i <= n; ++i) inv[i] = (jly - jly / i) * inv[jly % i] % jly;
  w = binom(n + s - 1, n - 1);
  for (int i = (1 << n) - 1; i; --i) {
    u = n + s;
    v = 0;
    for (int j = 0; j < n; ++j)
      if (i & (1 << j)) {
        u -= f[j];
        ++v;
      }
    u -= v + 1;
    if (v & 1)
      w = mjly(w - binom(u, n - 1));
    else
      w = mjly(w + binom(u, n - 1));
  }
  printf("%lld", w);
  return 0;
}
