#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define UNIQUE(a) sort(all(a));a.erase(unique(all(a)),a.end())
#define decimal cout<<fixed<<setprecision(10)
using ll=long long;
using P=pair<ll,ll>;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
constexpr ll inf=1001001001001001;
constexpr int INF=1001001001;
constexpr int mod=1000000007;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
void YesNo(bool b){if(b)out("Yes");else out("No");}
void yesno(bool b){if(b)out("yes");else out("no");}
void YESNO(bool b){if(b)out("YES");else out("NO");}
ll modpow(ll a,ll b){ll c=1;while(b>0){if(b&1){c=a*c%mod;}a=a*a%mod;b>>=1;}return c;}
vi calc(ll x){vi v;while(x>0){v.eb(x%10);x/=10;}reverse(all(v));return v;}

int main(){
    double a,b;
    cin>>a>>b;
    decimal;
    out(a*b/100);
}
#include <bits/stdc++.h>
using namespace std;


//#define int long long 


template <int mod = 1000000007>
struct modint{
    int x;
    modint(int y = 0) : x((y % mod + mod) % mod) { }
    friend modint operator^(modint a, long long b) {
        modint r = 1;
        for(; b; b >>= 1, a *= a) if(b & 1) r *= a;
        return r;
    }
    friend modint operator-(modint a) {return modint(0) - a;}
    friend modint operator!(modint a) {return a ^ (mod - 2);}
    modint& operator/=(modint const& b) {return *this *= !b;}
    friend bool operator==(modint a, modint b) {return a.x == b.x;}
    friend bool operator!=(modint a, modint b) {return a.x != b.x;}
    friend modint operator+(modint a, modint const& b) {return a += b;}
    friend modint operator-(modint a, modint const& b) {return a -= b;}
    friend modint operator*(modint a, modint const& b) {return a *= b;}
    friend modint operator/(modint a, modint const& b) {return a /= b;}
    modint& operator*=(modint const& b) {x = 1LL * x * b.x % mod; return *this;}
    friend ostream& operator<<(ostream& os, modint const& a) {return os << a.x;}
    modint& operator+=(modint const& b) {x += b.x; x = (x >= mod) ? x - mod : x;return *this;}
    modint& operator-=(modint const& b) {x = x >= b.x ? x - b.x : x - b.x + mod;return *this;}
};

using mint = modint <>;


mint nCr(int n, int m) {
    if(m > n) return mint(0);
    mint res = 1;
    for(int i = n - m + 1; i <= n; i++) res *= i;
    for(int i = 1; i <= m; i++) res /= i;
    return res;
}

int32_t main() {
   
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m, sum = 0; cin >> n >> m;
    vector <int> v(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
        sum += v[i];
    }

    if(sum > m) {
        cout << 0 << endl;
        return 0;
    }

    mint a = nCr(m + n, (sum + n));
    cout << a << endl;
}