#include <bits/stdc++.h>
#define mp make_pair
#define fir first
#define sec second
#define mt make_tuple
#define int long long
#define fin(File) freopen(File".in","r",stdin)
#define fout(File) freopen(File".out","w",stdout)
using namespace std;
const int N=410;
const int mod=1e9+7;
int n,m,k,a[N],b[N];
char s[N][N];
int qpow(int a,int b){
	a%=mod;int res=1;
	while(b){
		if(b&1)res=(res*a)%mod;
		a=(a*a)%mod;b>>=1;
	}return res;
}
int mat[N][N];
int Gauss(int n){
	int det=1;
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			while(mat[i][i]){
				int tmp=mat[j][i]/mat[i][i];
				for(int k=i;k<=n;k++)
					mat[j][k]-=mat[i][k]*tmp%mod,mat[j][k]=(mat[j][k]+mod)%mod;
				for(int k=i;k<=n;k++)
					swap(mat[i][k],mat[j][k]);
				det*=-1;
			}
			for(int k=i;k<=n;k++)
				swap(mat[i][k],mat[j][k]);
			det*=-1;
		}
	}det=(det+mod)%mod;
	for(int i=1;i<=n;i++)
		det*=mat[i][i],det=det%mod;
	return det;
}
int flg=0,ans=0;
int dp[55][N][N];
map <pair<pair<int,int>,pair<vector<int>,vector<int>>>,int> vis;
void dfs(int x,int y,vector <int> A,vector <int> B,int p){
	if(vis.count(mp(mp(x,y),mp(A,B))))return;
	vis[mp(mp(x,y),mp(A,B))]=1;
	if(p==A.size()){
		//cout<<"st: "<<endl;
		//for(auto it:A)cout<<it<<" ";
		//cout<<endl;
		//for(auto it:B)cout<<it<<" ";
		//cout<<endl;
		for(int i=1;i<=p;i++){
			for(int j=1;j<=p;j++){
				mat[i][j]=dp[A[i-1]][k][b[B[j-1]]];
			}
		}
		int now=Gauss(p);
		//cout<<now<<endl;
		if(now)flg=1;
		ans+=now;ans%=mod;
	}
	if(x>n||y>m)return;
	if(min(n-x+1,m-y+1)+A.size()<p)return;
	dfs(x,y+1,A,B,p);
	if(a[x]<=b[y]){
		dfs(x+1,y,A,B,p);
		A.push_back(x);
		B.push_back(y);
		dfs(x+1,y+1,A,B,p);
	}
}
void solve(int p){
	flg=0;ans=0;vis.clear();
	dfs(1,1,vector<int>(),vector<int>(),p);
	if(flg){
		cout<<p<<" "<<ans<<"\n";
		exit(0);
	}
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++)cin>>b[i];
	sort(a+1,a+1+n);sort(b+1,b+1+m);
	for(int i=1;i<=k;i++)cin>>(s[i]+1);
	for(int p=1;p<=n;p++){
		dp[p][1][a[p]]=1;
		for(int i=1;i<=k;i++){
			for(int j=1;j<=k;j++){
				if(s[i][j]=='0')dp[p][i][j]=0;
				dp[p][i+1][j]+=dp[p][i][j];
				dp[p][i][j+1]+=dp[p][i][j];
				dp[p][i+1][j]%=mod;
				dp[p][i][j+1]%=mod;
			}
		}
	}
	for(int i=min(n,m);i>=1;i--)
		solve(i);
	cout<<0<<" "<<1<<"\n";
	return 0;
}