#include <bits/stdc++.h>
using namespace std;
const int N = 30;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const long long linf = 2e18;
const int MOD = 1000000007;
void print(int x) {
  cout << x << endl;
  exit(0);
}
void PRINT(string x) {
  cout << x << endl;
  exit(0);
}
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
long long a[N];
long long m, ans = 0;
int inv[N], n;
int power(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % MOD)
    if (b & 1) res = 1ll * res * a % MOD;
  return res;
}
int C(long long y, int x) {
  if (y < 0 || x < 0 || y < x) return 0;
  y %= MOD;
  if (y == 0 || x == 0) return 1;
  int ans = 1;
  for (int i = (0); i <= (x - 1); i++) ans = 1ll * ans * (y - i) % MOD;
  for (int i = (1); i <= (x); i++) ans = 1ll * ans * inv[i] % MOD;
  return ans;
}
signed main() {
  scanf("%d%lld", &n, &m);
  for (int i = (1); i <= (n); i++) scanf("%lld", &a[i]);
  for (int i = (1); i <= (20); i++) inv[i] = power(i, MOD - 2);
  for (int x = (0); x <= ((1 << n) - 1); x++) {
    if (x == 0)
      ans = (ans + C(n + m - 1, n - 1)) % MOD;
    else {
      long long t = n + m;
      int p = 0;
      for (int i = (0); i <= (n - 1); i++)
        if (x >> i & 1) {
          p++;
          t -= a[i + 1];
        }
      t -= p + 1;
      if (p & 1)
        ans = (ans - C(t, n - 1)) % MOD;
      else
        ans = (ans + C(t, n - 1)) % MOD;
    }
  }
  printf("%d\n", (ans + MOD) % MOD);
  return 0;
}
