#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:67108864")
bool ascending(int i, int j) { return (i < j); }
bool descending(int i, int j) { return (i > j); }
using namespace std;
long long n, s;
long long mod = 1000 * 1000 * 1000 + 7;
const long long MAX = 100;
long long fact[MAX];
void PreCalc() {
  fact[0] = 1;
  fact[1] = 1;
  for (int(i) = (2); (i) < (MAX); (i)++) fact[i] = (fact[i - 1] * i) % mod;
}
long long countFact(long long n, long long p) {
  long long k = 0;
  while (n >= p) {
    k += n / p;
    n /= p;
  }
  return k;
}
long long powmod(long long a, long long b, long long m) {
  long long x = a, p = 1;
  while (b > 0) {
    if (b % 2) p = ((p % m) * (x % m)) % m;
    b /= 2;
    x = ((x % m) * (x % m)) % m;
  }
  return p;
}
long long inverse(long long n, long long p) { return powmod(n, p - 2, p); }
long long C(long long n, long long k, long long p) {
  if (countFact(n, p) > countFact(n - k, p)) {
    return 0;
  }
  long long ans = 1LL;
  for (long long i = n - k + 1; i <= n; i++)
    ans = ((ans % mod) * (i % mod)) % mod;
  ans = ((ans % mod) * inverse(fact[k], mod)) % mod;
  return ans;
}
long long f(long long n, long long m, long long i) {
  if (n < 0 || m < 0) return 0;
  if (i <= 0) return 0;
  return C(n + m, n, mod);
}
long long MOD(long long a) {
  while (a < 0) a += mod;
  return a % mod;
}
long long F[25];
int main() {
  PreCalc();
  cin >> n >> s;
  for (int(i) = 0; (i) < (n); (i)++) cin >> F[i];
  long long ans = 0;
  for (int(mask) = 0; (mask) < ((1 << n)); (mask)++) {
    long long tmps = s;
    int cnt = 0;
    for (int(j) = 0; (j) < (n); (j)++) {
      if (mask & (1 << j)) tmps -= F[j] + 1, cnt++;
    }
    if (tmps < 0) continue;
    long long cans = C(tmps + n - 1, n - 1, mod);
    if (cnt % 2 == 1) cans *= -1;
    ans = (ans + cans) % mod;
    ans = (ans + mod) % mod;
  }
  cout << ans << endl;
}
