#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(nullptr));
const long long INF = 1e18, P = 1e9 + 7, N = 2e5 + 10;
const long double EPS = 1e-9;
long long inv_fact[N];
long long my_pow(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  if (b % 2) {
    return ((long long)my_pow(a, b - 1) * a) % P;
  }
  long long t = my_pow(a, b / 2);
  return (long long)t * t % P;
}
long long get_c(long long n, long long k) {
  if (n < k || k < 0) {
    return 0;
  }
  n %= P;
  long long ans = 1;
  for (long long i = 0; i < k; i++) {
    ans *= (n - i + P) % P;
    ans %= P;
  }
  return ans * inv_fact[k] % P;
}
void solve() {
  inv_fact[0] = 1;
  for (long long i = 1; i < N; i++) {
    inv_fact[i] = inv_fact[i - 1] * my_pow(i, P - 2) % P;
  }
  long long n, s;
  cin >> n >> s;
  vector<long long> f(n);
  for (long long i = 0; i < n; i++) {
    cin >> f[i];
  }
  long long ans = 0;
  for (long long mask = 0; mask < (1 << n); mask++) {
    long long cur = 1;
    if (__builtin_popcount(mask) % 2) {
      cur = -1;
    }
    long long sum = 0;
    for (long long i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        sum += f[i] + 1;
      }
    }
    ans += (cur * get_c(s - sum + n - 1, n - 1) + P) % P;
    ans %= P;
  }
  cout << ans << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
