#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
ll qp(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
ll n, s, f[25];
ll C(ll x, ll y) {
  if (x < y) return 0;
  y = min(y, x - y);
  ll a = 1, b = 1;
  for (int i = 1; i <= y; i++)
    a = a * ((x - i + 1) % mod) % mod, b = b * i % mod;
  return a * qp(b, mod - 2) % mod;
}
ll g[25], num[(1 << 20)];
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> s;
  for (int i = 1; i < (1 << n); i++) num[i] = num[i - (i & (-i))] + 1;
  for (int i = 0; i < n; i++) cin >> f[i];
  for (int i = 0; i < (1 << n); i++) {
    ll sum = s;
    for (int j = 0; j < n; j++) {
      if ((1 << j) & i) sum -= f[j] + 1;
    }
    (g[num[i]] += C(sum + n - 1, n - 1)) %= mod;
  }
  ll ans = 0;
  for (int i = 0; i <= n; i++) {
    if (i & 1)
      ans -= g[i];
    else
      ans += g[i];
  }
  cout << (ans % mod + mod) % mod << endl;
  return 0;
}
