#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int qpow(int a,int b){
	int c=1;for(;b;b>>=1){
		if(b&1)c=1ll*a*c%mod;
		a=1ll*a*a%mod;
	}
	return c;
}
int head[320100],to[1010000],cur[320010],nxt[1010000],flow[1010000],cn=1;
void ad(int u,int v){
	to[++cn]=v,flow[cn]=1,nxt[cn]=head[u],head[u]=cn;
	to[++cn]=u,flow[cn]=0,nxt[cn]=head[v],head[v]=cn;
}
int S,T,d[320010];
bool bfs(){
	for(int i=1;i<=T;i++)cur[i]=head[i],d[i]=0;d[S]=1;queue<int>q;q.push(S);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int i=head[u];i;i=nxt[i])if(flow[i]&&!d[to[i]])
		d[to[i]]=d[u]+1,q.push(to[i]);
	}
	return d[T]>0;
}
int dfs(int s,int in){
	if(s==T)return in;int out=0;
	for(int &i=cur[s];i&&in;i=nxt[i])if(flow[i]&&d[to[i]]==d[s]+1){
		int p=dfs(to[i],min(in,flow[i]));
		flow[i]-=p,flow[i^1]+=p,in-=p,out+=p;
	}
	if(!out)d[s]=0;return out;
}
int n,dp[510][510],e[510][510],Z[510][510];
int ip(int o,int x,int y){return o*n*n+(x-1)*n+y;}
char c[510];
int t1,t2,X[510],Y[510],sum;
namespace Sub1{
	int dp[1<<18],dp2[1<<18],pp[1<<18];
	void sol(){
		memset(dp,0,sizeof(dp));
		for(int i=1;i<(1<<t1);i++)pp[i]=pp[i>>1]+(i&1);
		dp[0]=1;
		for(int i=1;i<=t2;i++){
			for(int s=0;s<(1<<t1);s++)dp2[s]=0;
			for(int s=0;s<(1<<t1);s++){
				int fp=1;
				for(int j=t1-1;j>=0;j--){
					if(!((s>>j)&1))
					(dp2[s|(1<<j)]+=1ll*dp[s]*fp%mod*Z[X[j+1]][Y[i]]%mod)%=mod;
					else fp=-fp;
				}
				(dp2[s]+=dp[s])%=mod;
			}
			for(int s=0;s<(1<<t1);s++)dp[s]=dp2[s];
		}
		int ans=0;
		for(int s=0;s<(1<<t1);s++)if(pp[s]==sum)(ans+=dp[s])%=mod;
		printf("%d\n",(ans+mod)%mod);
	}
}
int f[510][510];
int main(){
	scanf("%d%d%d",&t1,&t2,&n);
	S=n*n*2+1,T=n*n*2+2;
	for(int i=1;i<=t1;i++)scanf("%d",&X[i]),ad(S,ip(0,1,X[i]));
	for(int i=1;i<=t2;i++)scanf("%d",&Y[i]),ad(ip(1,n,Y[i]),T);
	for(int i=1;i<=n;i++){
		scanf("%s",c+1);for(int j=1;j<=n;j++){
			e[i][j]=c[j]-'0';
			if(e[i][j])ad(ip(0,i,j),ip(1,i,j));
			if(i<n)ad(ip(1,i,j),ip(0,i+1,j));
			if(j<n)ad(ip(1,i,j),ip(0,i,j+1));
		}
	}
	while(bfs())sum+=dfs(S,1e9);
	printf("%d ",sum);
	for(int i=1;i<=n;i++){
		memset(dp,0,sizeof(dp));
		for(int j=1;j<=n;j++)for(int k=1;k<=n;k++){
			dp[j][k]=(dp[j-1][k]+dp[j][k-1])%mod;
			if(j==1&&i==k)dp[j][k]++;
			if(e[j][k]==0)dp[j][k]=0;
		}
		for(int j=i;j<=n;j++)Z[i][j]=dp[n][j];
	}
	if(t1<=10||t1<=18&&t2<=18){Sub1::sol();return 0;}
	for(int i=1;i<=t1;i++)for(int j=1;j<=t2;j++)f[i][j]=Z[X[i]][Y[j]];
	n=t1;
	int ans=1;
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++)if(f[j][i]){
			for(int z=1;z<=n;z++)swap(f[i][z],f[j][z]);
			ans=-ans;break;
		}
		if(!f[i][i]){ans=0;break;}
		int I=qpow(f[i][i],mod-2);
		for(int j=1;j<=n;j++)if(i!=j){
			int z=1ll*f[j][i]*I%mod;
			for(int k=1;k<=n;k++)(f[j][k]-=1ll*z*f[i][k]%mod)%=mod;
		}
	}
	for(int i=1;i<=n;i++)ans=1ll*ans*f[i][i]%mod;
	return printf("%d",(ans%mod+mod)%mod),0;
}