#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

const int N=;

typedef long long ll;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-; c=getchar();}

    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}

    return x*f;

}

int n,r,b,g,m,P,a[N];

int f[N],d[N][][],w[N],ans;

bool vis[N];

inline void mod(int &x){if(x>=P) x-=P;}

void dp(){

    int s=;

    memset(vis,,sizeof(vis));

    for(int i=;i<=n;i++) if(!vis[i]){

        int u=a[i],len=;

        while(u!=i) vis[u]=,len++,u=a[u];

        w[++s]=len;

    }

    memset(d,,sizeof(d));

    d[][][]=;

    for(int i=;i<=s;i++)

        for(int j=r;j>=;j--)

            for(int k=g;k>=;k--)

                for(int l=b;l>=;l--){

                    if(j>=w[i]) mod(d[j][k][l]+=d[j-w[i]][k][l]);

                    if(k>=w[i]) mod(d[j][k][l]+=d[j][k-w[i]][l]);

                    if(l>=w[i]) mod(d[j][k][l]+=d[j][k][l-w[i]]);

                }

    mod(ans+=d[r][g][b]);

}

inline int Pow(int a,int b){

    int re=;

    for(;b;b>>=,a=a*a%P)

        if(b&) re=re*a%P;

    return re;

}

inline int Inv(int a){return Pow(a,P-);}

int main(){

    freopen("in","r",stdin);

    r=read();b=read();g=read();m=read();P=read();

    n=r+b+g;

    for(int j=;j<=m;j++){

        for(int i=;i<=n;i++) a[i]=read();

        dp();

    }

    m++;

    for(int i=;i<=n;i++) a[i]=i;

    dp();

    ans=ans*Inv(m)%P;

    printf("%d",ans);

}