Codeforces#258 (Div.2) E - Devu and Flowers

E. Devu and Flowers

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Devu wants to decorate his garden with flowers. He has purchased n boxes, where the i-th box contains f_i flowers. All flowers in a single box are of the same color (hence they are indistinguishable). Also, no two boxes have flowers of the same color.

Now Devu wants to select exactly s flowers from the boxes to decorate his garden. Devu would like to know, in how many different ways can he select the flowers from each box? Since this number may be very large, he asks you to find the number modulo (10⁹ + 7).

Devu considers two ways different if there is at least one box from which different number of flowers are selected in these two ways.

Input

The first line of input contains two space-separated integers n and s (1 ≤ n ≤ 20, 0 ≤ s ≤ 10¹⁴).

The second line contains n space-separated integers f₁, f₂, ... f_n (0 ≤ f_i ≤ 10¹²).

Output

Output a single integer — the number of ways in which Devu can select the flowers modulo (10⁹ + 7).

Sample test(s)

Input

2 3
1 3

Output

2

Input

2 4
2 2

Output

1

Input

3 5
1 3 2

Output

3

Note

Sample 1. There are two ways of selecting 3 flowers: {1, 2} and {0, 3}.

Sample 2. There is only one way of selecting 4 flowers: {2, 2}.

Sample 3. There are three ways of selecting 5 flowers: {1, 2, 2}, {0, 3, 2}, and {1, 3, 1}.

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <map>
#define maxn 100000 + 10
#define INF 0x7fffffff
#define MOD 1000000007
#define ll long long
using namespace std;
ll f[30], inv[21]; ;
void gcd(ll a, ll b, ll& d, ll& x, ll& y) {
    if(!b) { d = a; x = 1; y = 0; }
    else{ gcd(b, a%b, d, y, x); y -= x*(a/b); }
}
ll getInv(ll a, ll n) {
    ll d, x, y;
    gcd(a, n, d, x, y);
    return d == 1 ? ( x + n ) % n : -1;
}
ll C(ll n,ll m)
{

    if(n < m) return 0;
    ll ans;
    ans=1;
    for(ll i=n;i >= (n-m+1); --i)
    {
        ans = ans*(i%MOD)%MOD;
        ans = ans*inv[n-i+1]%MOD;
    }
    return ans%MOD;
}
int n;
ll s;
ll solve()
{
    ll ans = 0;
    for(int i = 0; i < (1<<n); ++i)
    {
        int flag = 1;
        ll sum = s;
        for(int j = 0; j < n; ++j)
        {
            if(i & (1<<j))
            {
                sum -= f[j]+1;
                flag = -flag;
            }
        }
        if(sum < 0) continue;
        ans += flag*C(sum+n-1, n-1);
        ans %=MOD;
    }
    return (ans+MOD)%MOD;
}
int main()
{
    for(int i = 1;i <= 20; ++i) inv[i] = getInv(i, MOD);
    scanf("%d%I64d", &n, &s);
    for(int i = 0; i < n; ++i)
        scanf("%I64d", &f[i]);
    printf("%I64d\n", solve());
    return 0;
}