//Code by Lightningfall
//Start coding on ????/??/??
//Finish debugging on ????/??/??
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int powdv(int x,int y=mod-2){
	int ans=1;
	while(y){
		if(y&1)ans=1ll*ans*x%mod;
		y>>=1,x=1ll*x*x%mod;
	}
	return ans;
}
int n,m,k;
int a[405],b[405];
char s[405][405];
int d[405][405],f[405][405];
int a1[405],a2[405],z[405][405];
int A[405][405],B[405][405],C[405][405];
int c[805][805],p[805][805];
int pp[805],q[805];
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	for(int i=1;i<=m;++i)scanf("%d",&b[i]);
	for(int i=1;i<=k;++i)scanf("%s",s[i]+1);
	for(int i=1;i<=n;++i){
		for(int j=1;j<=k;++j)for(int l=1;l<=k;++l){
			f[j][l]=0;
		}
		if(s[1][a[i]]=='1')f[1][a[i]]=1;
		for(int j=1;j<=k;++j)for(int l=1;l<=k;++l)if(f[j][l]){
			if(s[j+1][l]=='1')f[j+1][l]=(f[j+1][l]+f[j][l])%mod;
			if(s[j][l+1]=='1')f[j][l+1]=(f[j][l+1]+f[j][l])%mod;
		}
		for(int j=1;j<=m;++j){
			d[i][j]=f[k][b[j]];
		}
	}
	d[++n][++m]=1;
	for(int i=1;i<n;++i)for(int j=i+1;j<=n;++j){
		for(int l=1;l<=m;++l)a1[l]=d[i][l],a2[l]=d[j][l];
		int h1=0,h2=0,zz=0;
		for(int l=m;l>=1;--l){
			zz=(zz+1ll*a1[l]*h2-1ll*a2[l]*h1)%mod;
			h1=(h1+a1[l])%mod,h2=(h2+a2[l])%mod;
		}
		z[i][j]=(zz+mod)%mod,z[j][i]=(-zz+mod)%mod;
	}
	int ls=n;
	if(n&1)++n;
	for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j){
		A[i][j]=(i+j+1)%2==1?-1:1;
		if(j==ls)B[i][j]=z[i][j];
		else if(j<ls)C[i][j]=z[i][j];
		A[j][i]=-A[i][j],B[j][i]=-B[i][j],C[j][i]=-C[i][j];
	}
	int gs=0,r=1;
	for(int i=1;i<=n;++i){
		while(!C[i][i]){
			for(int j=i+1;j<=n;++j)if(C[j][i]){
				for(int k=1;k<=n;++k){
					swap(A[j][k],A[i][k]);
					swap(B[j][k],B[i][k]);
					swap(C[j][k],C[i][k]);
				}
				r=-r;
				break;
			}
			if(C[i][i])break;
			for(int j=1;j<=n;++j)
				C[j][i]=B[j][i],B[j][i]=A[j][i],A[j][i]=0;
			++gs;
			for(int j=1;j<i;++j){
				int zz=-C[j][i];
				for(int k=1;k<=n;++k){
					A[k][i]=(A[k][i]+1ll*zz*A[k][j])%mod;
					B[k][i]=(B[k][i]+1ll*zz*B[k][j])%mod;
					C[k][i]=(C[k][i]+1ll*zz*C[k][j])%mod;
				}
			}
		}
		r=1ll*r*C[i][i]%mod;
		int ny=powdv(C[i][i]);
		for(int j=1;j<=n;++j){
			A[i][j]=1ll*A[i][j]*ny%mod;
			B[i][j]=1ll*B[i][j]*ny%mod;
			C[i][j]=1ll*C[i][j]*ny%mod;
		}
		for(int j=i+1;j<=n;++j){
			int zz=-C[j][i];
			for(int k=1;k<=n;++k){
				A[j][k]=(A[j][k]+1ll*zz*A[i][k])%mod;
				B[j][k]=(B[j][k]+1ll*zz*B[i][k])%mod;
				C[j][k]=(C[j][k]+1ll*zz*C[i][k])%mod;
			}
		}
		for(int j=i+1;j<=n;++j){
			int zz=-C[i][j];
			for(int k=1;k<=n;++k){
				A[k][j]=(A[k][j]+1ll*zz*A[k][i])%mod;
				B[k][j]=(B[k][j]+1ll*zz*B[k][i])%mod;
				C[k][j]=(C[k][j]+1ll*zz*C[k][i])%mod;
			}
		}
	}
	for(int i=n+1;i<=2*n;++i)c[i-n][i]=1;
	for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)
		c[i+n][j]=-A[i][j],c[i+n][j+n]=-B[i][j];
	for(int i=1;i<=2*n-1;++i){
		if(!c[i+1][i]){
			for(int j=i+2;j<=2*n;++j)if(c[j][i]){
				for(int k=1;k<=2*n;++k)swap(c[i+1][k],c[j][k]);
				for(int k=1;k<=2*n;++k)swap(c[k][i+1],c[k][j]);
				break;
			}
		}
		if(!c[i+1][i])continue;
		int ny=powdv(c[i+1][i]);
		for(int j=i+2;j<=2*n;++j)if(c[j][i]){
			int zz=-1ll*ny*c[j][i]%mod;
			for(int k=1;k<=2*n;++k)c[j][k]=(c[j][k]+1ll*zz*c[i+1][k])%mod;
			for(int k=1;k<=2*n;++k)c[k][i+1]=(c[k][i+1]-1ll*zz*c[k][j])%mod;
		}
	}
	p[0][0]=1;
	for(int i=1;i<=2*n;++i){
		for(int j=0;j<i;++j)p[i][j]=p[i-1][j];
		for(int j=i-1;j>=0;--j){
			p[i][j+1]=(p[i][j+1]+p[i][j])%mod;
			p[i][j]=-1ll*p[i][j]*c[i][i]%mod;
		}
		int xs=c[i][i-1];
		for(int j=i-1;j>=1;--j){
			int tt=-1ll*xs*c[j][i]%mod;
			for(int l=0;l<j;++l)p[i][l]=(p[i][l]+1ll*tt*p[j-1][l])%mod;
			xs=1ll*xs*c[j][j-1]%mod;
		}
	}
	int s=2*n-gs;
	for(int i=0;i<=s;++i)pp[i]=(1ll*r*p[2*n][i+gs]%mod+mod)%mod;
	q[0]=1;
	for(int i=1;i<=s/2;++i){
		int zz=pp[i];
		for(int j=1;j<=i-1;++j)zz=(zz-1ll*q[j]*q[i-j])%mod;
		q[i]=1ll*(mod+1)/2*(zz+mod)%mod;
	}
	printf("%d %d\n",s/2,q[s/2]);
	return 0;
}