#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); }
int inv[N];
long long a[N];
long long ans = 0, m;
int n;
int pw(int a, int b) {
  int s = 1;
  for (; b; b >>= 1, a = 1ll * a * a % MOD)
    if (b & 1) s = 1ll * s * a % MOD;
  return s;
}
int c(long long a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  a %= MOD;
  if (!a || !b) return 1;
  int ans = 1;
  for (int i = (0); i <= (b - 1); i++) ans = 1ll * ans * (a - i) % MOD;
  for (int i = (1); i <= (b); i++) ans = 1ll * ans * inv[i] % MOD;
  return ans;
}
signed main() {
  scanf("%d%lld", &n, &m);
  for (int i = (0); i <= (n - 1); i++) scanf("%lld", &a[i]);
  for (int i = (1); i <= (20); i++) inv[i] = pw(i, MOD - 2);
  for (int x = (0); x <= ((1 << n) - 1); x++) {
    long long rs = n + m;
    int sum = 0;
    for (int i = (0); i <= (n - 1); i++)
      if (x >> i & 1) {
        rs -= a[i];
        sum++;
      }
    rs -= sum + 1;
    if (sum & 1)
      ans = (ans - c(rs, n - 1)) % MOD;
    else
      ans = (ans + c(rs, n - 1)) % MOD;
  }
  printf("%d\n", (ans + MOD) % MOD);
}
