#include<bits/stdc++.h>
using namespace std;
char ch[21],c[21][21][21],b[21][21],(&a)[21][21]=c[0];
struct opt{int op,x,y;}g;
vector<opt>ans;map<char,int>cnt;
int h[21],w[21],vis[21][21],&n=h[0],&m=w[0],k;
bool check(int k){
	cnt.clear();
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cnt[b[i][j]]++;
	for(int i=1;i<=h[k];i++){
		for(int j=1;j<=w[k];j++){
			if(cnt[c[k][i][j]])cnt[c[k][i][j]]--;
			else if(cnt['*'])cnt['*']--;
			else return 0;
		}
	}
	return 1;
}
void solve(int k){
	memset(vis,0,sizeof vis);
	for(int i=1;i<=h[k];i++){
		for(int j=1;j<=w[k];j++){
			int x=0,y=0;
			for(int l=1;l<=n;l++){
				if(x||y)break;
				for(int r=1;r<=m;r++)
					if(!vis[l][r]&&b[l][r]==c[k][i][j]){x=l,y=r;break;}
			}
			for(int l=1;l<=n;l++){
				if(x||y)break;
				for(int r=1;r<=m;r++)
					if(!vis[l][r]&&b[l][r]=='*'){x=l,y=r;break;}
			}
			if(!x&&!y){cerr<<"WARNING:BUG on solving "<<k<<"!!!\n";}
			while(y<j)swap(b[x][y],b[x][y+1]),ans.push_back({-1,x,y++});
			while(y>j)swap(b[x][y],b[x][y-1]),ans.push_back({-2,x,y--});
			while(x<i)swap(b[x][y],b[x+1][y]),ans.push_back({-3,x++,y});
			while(x>i)swap(b[x][y],b[x-1][y]),ans.push_back({-4,x--,y});
			vis[i][j]=1;
		}
	}
	for(int i=1;i<=h[k];i++)
		for(int j=1;j<=w[k];j++)
			b[i][j]='*';
	if(k)ans.push_back({k,1,1});
}
int main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>a[i][j];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>b[i][j];
	for(int i=1;i<=k;i++){
		cin>>h[i]>>w[i];
		for(int j=1;j<=h[i];j++)
			for(int l=1;l<=w[i];l++)
				cin>>c[i][j][l];
	}
	while(!check(0)){
		bool flag=1;
		for(int i=1;i<=k;i++)
			if(check(i))flag=0,solve(i);
		if(flag){cout<<"-1\n";return 0;}
	}
	solve(0);reverse(ans.begin(),ans.end());
	cout<<ans.size()<<'\n';
	for(auto [op,x,y]:ans)
		cout<<op<<' '<<x<<' '<<y<<'\n';
	return 0;
}