#include <iostream>
#include <cstdio>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
using namespace std;
typedef long long ll;
const int P = 1e9+7, P2 = 998244353, INF = 0x3f3f3f3f;
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
const int N = 1e6+10;
int n, fac[N], ifac[N];
int C(int n, int m) {if (m>n) return 0;int t = (ll)fac[n]*ifac[m]%P*ifac[n-m]%P;return t;
}
int main() {fac[0]=ifac[0]=1;REP(i,1,N-1) fac[i]=(ll)fac[i-1]*i%P;ifac[N-1] = inv(fac[N-1]);PER(i,1,N-2) ifac[i]=(ll)ifac[i+1]*(i+1)%P;scanf("%d", &n);int ans = 1, sum = 0;REP(i,1,n) {int t;scanf("%d", &t);ans = (ll)ans*C(sum+t-1,t-1)%P;sum += t;}printf("%d\n", ans);
}

#include <iostream>
#include <cstdio>
#define REP(i,a,n) for(int i=a;i<=n;++i)
using namespace std;typedef long long ll;
int n;
ll f[100], k;int main() {f[0] = 1, f[1] = 1;REP(i,2,88) f[i]=f[i-1]+f[i-2];scanf("%d%lld", &n, &k);REP(i,1,n) {if (k<=f[n-i]) printf("%d ",i);else {k -= f[n-i];printf("%d %d ", i+1, i);++i;}}puts("");
}

#include <iostream>
#include <cstdio>
#include <queue>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
using namespace std;
typedef long long ll;
const int N = 1e6+10, P = 1e9+7;
int n, m, ans, vis[N];
struct _ {int to,w;};
vector<_> g[N];
void dfs(int x) {for (_ e:g[x]) {if (vis[e.to]==-1) {vis[e.to] = vis[x]^e.w;dfs(e.to);}else if (vis[e.to]!=(vis[x]^e.w)) ans = 0;}
}
int main() {scanf("%d%d", &n, &m);while (m--) {int u, v, w;scanf("%d%d%d", &u, &v, &w);g[u].pb({v,!w}),g[v].pb({u,!w});}memset(vis,-1,sizeof vis);ans = (P+1)/2;REP(i,1,n) if (vis[i]==-1) {vis[i] = 1, ans = (ll)ans*2%P, dfs(i);}printf("%d\n", ans);
}

#include <iostream>
#include <cstdio>
#include <queue>
#define REP(i,a,n) for(int i=a;i<=n;++i)
using namespace std;const double eps = 1e-8;
const int N = 1e5+10;
int n, m, k;
int deg[N], vis[N], cnt[N], used[N];
vector<int> g[N];
queue<int> q;
int chk(double x) {REP(i,1,n) cnt[i] = 0;REP(i,1,n) if (!vis[i]) { used[i] = 1;for (int j:g[i]) ++cnt[j];}REP(i,1,n) if (cnt[i]<x*deg[i]) q.push(i);while (q.size()) {int u = q.front(); q.pop();if (!used[u]) continue;used[u] = 0;for (int v:g[u]) if (--cnt[v]<x*deg[v]) q.push(v);}int tot = 0;REP(i,1,n) tot += used[i];return tot;
}int main() {scanf("%d%d%d", &n, &m, &k);REP(i,1,k) {int t;scanf("%d", &t);vis[t] = 1;}REP(i,1,m) {int u, v;scanf("%d%d", &u, &v);g[u].push_back(v),g[v].push_back(u);++deg[u],++deg[v];}double l = -eps, r = 1, ans;REP(i,1,200) {double mid = (l+r)/2;if (chk(mid)) ans=mid,l=mid+eps;else r=mid-eps;}chk(ans);int tot = 0;REP(i,1,n) tot += used[i];printf("%d\n", tot);REP(i,1,n) if (used[i]) printf("%d ", i);puts("");
}