#include<bits/stdc++.h>
#define ShuaiBi main
#define Genshin 1+1
#define is ==
#define a_shit 2 
using namespace std;
typedef long long ll;
const int N=70;
map<char,int> mp1;
map<int,char> mp2;
void init(){
	srand(time(0));
	for(int i=0;i<26;i++) mp1[char('a'+i)]=i,mp2[i]=char('a'+i);
	for(int i=26;i<52;i++) mp1[char('A'+i-26)]=i,mp2[i]=char('A'+i-26);
	for(int i=52;i<62;i++) mp1[char('0'+i-52)]=i,mp2[i]=char('0'+i-52);
	mp1['*']=63,mp2[63]='*';
}
int t[N],need[N][N],n,m,k,gen;
struct ass{
	int a[N][N],n,m;
	void read(){
		char s[N];
		for(int i=1;i<=n;i++){
			scanf("%s",s+1);
			for(int j=1;j<=m;j++)
				a[i][j]=mp1[s[j]];
		}
	}
	void write(){
		for(int i=1;i<=n;i++,putchar('\n'))
			for(int j=1;j<=m;j++)
				cout<<mp2[a[i][j]];
		cout<<endl;
	}
}T,M[N];
struct point{int x,y;};
struct node{int id,x,y;};
vector<node> ans;
int dx[]={0,0,0,1,-1},dy[]={0,1,-1,0,0};
void Swap(int x,int y,int id){
	ans.push_back(node{-id,x,y}); 
	swap(T.a[x][y],T.a[x+dx[id]][y+dy[id]]);
}
void Move(point a,point b){
	if(!a.x && !a.y) return;
	if(a.x<b.x){
		while(a.x<b.x) Swap(a.x,a.y,3),a.x++;
		while(a.x>b.x) Swap(a.x,a.y,4),a.x--;
		while(a.y<b.y) Swap(a.x,a.y,1),a.y++;
		while(a.y>b.y) Swap(a.x,a.y,2),a.y--; 	
	}else{
		while(a.y<b.y) Swap(a.x,a.y,1),a.y++;
		while(a.y>b.y) Swap(a.x,a.y,2),a.y--; 
		while(a.x>b.x) Swap(a.x,a.y,4),a.x--;
		while(a.x<b.x) Swap(a.x,a.y,3),a.x++;
	}
}
point Find(int id,point x,int c){
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
		if((i>x.x || (i==x.x&& j>x.y) || (i<x.x && j>M[id].m)) && T.a[i][j]==c) return point{i,j};
	return point{0,0};
}
void count(){
	memset(t,0,sizeof(t));
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) t[T.a[i][j]]++;
	gen=t[63];
}
bool check(int id){
	int cnt=0;
	for(int i=0;i<62;i++) cnt+=max(0,need[id][i]-t[i]);
	if(cnt>gen) return 0;
	for(int i=0;i<62;i++)
		if(need[id][i] && t[i]) return 1;
	return 0; 
}
#define shit Find(id,point{i,j},M[id].a[i][j])
void Cover(int id){
	for(int i=1;i<=M[id].n;i++)
		for(int j=1;j<=M[id].m;j++)
			if(T.a[i][j]!=M[id].a[i][j])
			//	printf("(%d %d)->(%d %d)\n",shit.x,shit.y,i,j),
				Move(Find(id,point{i,j},M[id].a[i][j]),point{i,j});
//	T.write();cout<<"!"<<endl;
	for(int i=1;i<=M[id].n;i++)
		for(int j=1;j<=M[id].m;j++)
			if(T.a[i][j]!=M[id].a[i][j] && T.a[i][j]!=63)
				//printf("(%d,%d)要填* M:%c\n",i,j,mp2[T.a[i][j]]),
				Move(Find(id,point{i,j},63),point{i,j}); 
	//T.write();cout<<"?"<<endl;
	for(int i=1;i<=M[id].n;i++)
		for(int j=1;j<=M[id].m;j++)
			T.a[i][j]=63;
	ans.push_back(node{id,1,1});
}
int ShuaiBi(){
	//freopen("write.out","w",stdout);
	init();
	scanf("%d%d%d",&n,&m,&k);
	M[k+1].n=T.n=n,M[k+1].m=T.m=m; 
	M[k+1].read(),T.read();
	for(int i=1;i<=k;i++){
		scanf("%d%d",&M[i].n,&M[i].m);
		M[i].read();
	}
	for(int i=1;i<=k+1;i++)
		for(int j=1;j<=M[i].n;j++) for(int k=1;k<=M[i].m;k++)
			need[i][M[i].a[j][k]]++;
	int i=1,cou;
	while(Genshin is a_shit){
		count(),cou=0;
		while(cou<k && !check(i)) i=i%k+1,cou++;
		if(cou==k) break;
		//printf("id:%d\n",i);T.write();
		Cover(i);
	}
	int cnt=0;
	for(int i=0;i<62;i++) cnt+=max(0,need[k+1][i]-t[i]);
	if(cnt>gen) return puts("-1"),0;
	
	for(int i=0;i<62;i++)
		if(need[k+1][i] && t[i]){Cover(k+1),ans.pop_back();break;}
	
	printf("%d\n",(int)ans.size());
	while(!ans.empty()) printf("%d %d %d\n",ans.back().id,ans.back().x,ans.back().y),ans.pop_back();
	return 0;
}