【置换群】【bzoj 1004】: [HNOI2008]Cards

http://www.lydsy.com/JudgeOnline/problem.php?id=1004

套个DP，QAQ

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
int n,sr,sg,sb,m,p;
int perm[61];
/
int pow_mod(int a,int b,int p){int t=1;for(;b;b>>=1,a=a*a%p)if(b&1)t=t*a%p;return t;}
int cal()
{
	static int sz[61];
	static bool vis[61];
	static int dp[21][21][21];
	MS(sz,0); MS(vis,0); MS(dp,0);
	rep(i,1,n) if(!vis[i])
	{
		++*sz;
		for(int j=i;!vis[j];j=perm[j]) vis[j]=1,sz[*sz]++;
	}
	dp[0][0][0]=1;
	rep(i,1,*sz)
		per(r,sr,0) per(g,sg,0) per(b,sb,0)
		{
			if(r-sz[i]>=0) dp[r][g][b]+=dp[r-sz[i]][g][b];
			if(g-sz[i]>=0) dp[r][g][b]+=dp[r][g-sz[i]][b];
			if(b-sz[i]>=0) dp[r][g][b]+=dp[r][g][b-sz[i]];
			dp[r][g][b]%=p;
		}
	return dp[sr][sg][sb];
}
/
void input()
{
    sr=read(); sb=read(); sg=read(); m=read(); p=read();
    n=sr+sb+sg;
}
void solve()
{
	LL ans=0;
	rep(i,1,m)
	{
		rep(i,1,n) perm[i]=read();
		ans+=cal(); ans%=p;
	}
	rep(i,1,n) perm[i]=i;
	ans+=cal(); ans%=p;
	ans*=pow_mod(m+1,p-2,p); ans%=p;
	cout<<ans<<endl;
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    input(),solve();
    return 0;
}