#include<stdio.h>
#include<string.h>
typedef __int64 lld;
const int maxn=5005;
const int M=1000005;
lld d[2][maxn];
lld dp[maxn][maxn];
lld sum;
int l[M];
lld f1[maxn],f2[maxn];
int n,m,mod;
/*
3 2 1000
3 1 2
2 3 1000
2 2
1 3 100
5
*/
void init(){
int i,j,now;
f1[0]=f2[0]=1;
// memset(d,0,sizeof(d));
// memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(i=1;i<maxn;i++){
for(j=1;j<=i;j++)
dp[i][j]=(dp[i-1][j-1]+dp[i-1][j]*(j-1))%mod;
f1[i]=f1[i-1]*(m-i+1)%mod;
f2[i]=f2[i-1]*i%mod;
}
sum=1;now=0;
for(i=1;i<=n;i++,now^=1){
memset(d[now^1],0,sizeof(d[now^1]));
for(j=0;j<=l[i] && j<=m;j++){
d[now^1][j]=dp[l[i]][j]*((sum*f1[j]-d[now][j]*f2[j])%mod)%mod;
}
sum=0;
for(j=1;j<=l[i] && j<=m;j++){
sum=(sum+d[now^1][j])%mod;
}
}
}
int main(){
int i,j;
while(scanf("%d%d%d",&n,&m,&mod)!=EOF){
l[0]=0;
for(i=1;i<=n;i++)
scanf("%d",&l[i]);
init();
printf("%I64d\n",(sum+mod)%mod);
}
return 0;
}
New Year Garland
最新推荐文章于 2023-04-27 20:02:51 发布