#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//turn on extra precision
//#pragma GCC target("fpmath=387")

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef string str;
typedef pair <int,int> pii;
typedef pair <ll,ll> pll;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
#define fbo find_by_order
#define ook order_of_key
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define watch(x) cout << (#x) << " is : " << (x) << newl

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vi dirx = {0,0,1,-1};
vi diry = {1,-1,0,0};
char to_upper (char x){
    if( 97 <= int(x) && int(x) <= 122) return char(x-32);
    if( 65 <= int(x) && int(x) <= 90) return x;
    return -1;
}
char to_lower (char x){
    if( 97 <= int(x) && int(x) <= 122) return x;
    if( 65 <= int(x) && int(x) <= 90) return char(x+32);
    return -1;
}
int numerize (char x){
    if(48 <= int(x) && int(x) <= 57) return int(x-'0');
    if(97 <= int(x) && int(x) <= 122) return int(x-96);
    if(65 <= int(x) && int(x) <= 90) return int(x-64);
    return -1;
}
bool isect (int l1, int r1, int l2, int r2){ return max(l1,l2) <= min(r1,r2); }
ll quickpow (ll num1, ll num2, ll MOD){
    if(num2==0)return 1%MOD;
    else if(num2==1)return num1%MOD;
    else{
        ll temp = quickpow (num1,num2>>1LL,MOD); ll res = ((temp%MOD) * (temp%MOD))%MOD;
        if(num2&1) res = ((res%MOD)*(num1%MOD))%MOD; return res;
    }
}
ll invmod (ll num, ll MOD){return quickpow (num,MOD-2,MOD);}
ll gcd (ll num1, ll num2){
    if(num1 < num2) swap(num1,num2); ll num3 = num1 % num2 ;
    while(num3 > 0){ num1 = num2; num2 = num3; num3 = num1 % num2;}
    return num2;
}
ll lcm (ll num1 , ll num2){return (ll) (num1/__gcd(num1,num2))*num2;}
// end of Template
bool valid(int x, vi &v){
    int g = 0;
    for(auto i : v){
        if(i % x == 0) g = (g ? __gcd(g,i) : i);
    }
    return g == x;
}
int main(){

//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vi v(n); for(int i = 0; i < n; ++i) cin >> v[i];
    int mn = INT_MAX; for(auto i : v) mn = min(mn,i);

    set <int> s;
    for(auto x : v){
        for(int i = 1; i * i <= x; ++i){
            if(x % i == 0){
                if(i <= mn) s.insert(i);
                if(i != x / i && x / i <= mn) s.insert(x / i);
            }
        }
    }

    int res = 0;
    for(auto i : s) res += valid(i,v);
    cout << res << newl;

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void exgcd(ll a, ll b, ll& x, ll& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return;
  }
  exgcd(b % a, a, y, x);
  x -= (b / a) * y;
}
ll m = 1e9 + 7;
ll flip(ll a) {
  ll x, y;
  exgcd(a, m, x, y);
  if (x < 0) {
    ll kj = -x;
    kj /= m;
    x += (kj + 1) * m;
  }
  x %= m;
  return x;
}
int main () {
  int N;
  ll M;
  cin >> N >> M;
  M += (ll)N;
  ll sum = (ll)N;
  for (int i = 0; i < N; i ++) {
    ll a;
    cin >> a;
    sum += a;
  }
  ll ans = 1;
  for (ll i = 1; i <= sum; i ++) {
    ans *= (M - i + 1);
    ans %= m;
  }
  ll fli = 1;
  for (ll i = 1; i <= sum; i ++) {
    fli *= i;
    fli %= m;
  }
  ans *= flip(fli);
  ans %= m;
  cout << ans << endl;
}