1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
const int mod=1e9+7;
ll n,m,a[(int)1e3+9],dp[(int)1e3+9],ans;
int ksm(int a,int b){
int ret=1;
for(;b;b>>=1,a=1ll*a*a%mod)if(b&1)ret=1ll*ret*a%mod;
return ret;
}
int inv(int x){return ksm(x,mod-2);}
int fact[(int)1e5+9],inv_fact[(int)1e5+9];
int C(int n,int m){
if(m>n||n<0||m<0)return 0;
return 1ll*fact[n]*inv_fact[m]%mod*inv_fact[n-m]%mod;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
fact[0]=1;
f(i,1,2e3)fact[i]=1ll*fact[i-1]*i%mod;
inv_fact[2000]=inv(fact[2000]);
for(int i=2000-1;i>=0;i--)inv_fact[i]=1ll*inv_fact[i+1]*(i+1)%mod;
cin>>n>>m;
f(i,1,m)cin>>a[i];
for(int i=0;i<=n;++i){
dp[i]=1;
for(int j=1;j<=m;++j){
dp[i]=dp[i]*C(a[j]+n-i-1,n-i-1)%mod;
}
dp[i]=dp[i]*C(n,i)%mod;
}
for(int i=0;i<=n;++i){
ans=((ans+(i&1?-1ll:1ll)*dp[i])%mod+mod)%mod;
}
cout<<ans;
return 0;
}
|