#include<bits/stdc++.h>
#define ll long long
#define R register
#define PII pair<int,int>
#define mk(x,y) make_pair(x,y)
using namespace std;
const int N=25,range=65;
const int xx[]={0,0,0,1,-1},yy[]={0,1,-1,0,0};
int n,m,k;
struct Matrix{
	int h,w,cnt[range];char a[N][N];
	inline char to_ch(int x){
		if(!x)return '*';
		if(x>0&&x<27)return char(x+'a'-1);
		if(x>26&&x<53)return char(x-27+'A');
		return char(x-53+'0');
	}
	inline int to_num(char x){
		if(x=='*')return 0;
		if(x>='a'&&x<='z')return x-'a'+1;
		if(x>='A'&&x<='Z')return x-'A'+27;
		return x-'0'+53;
	}
	inline void getmat(){
		memset(cnt,0,sizeof cnt);
		for(R int i=1;i<=h;++i)for(R int j=1;j<=w;++j){char ch;cin>>ch;a[i][j]=to_num(ch);++cnt[to_num(ch)];}
	}
}st,ed,tu[N];
vector<pair<int,PII> > res;
inline void Swap(PII which,int dir){
	res.emplace_back(mk(dir,mk(which.first,which.second)));
	// cerr<<which.first<<' '<<which.second<<' '<<which.first+xx[-dir]<<' '<<which.second+yy[-dir]<<'\n';
	swap(ed.a[which.first][which.second],ed.a[which.first+xx[-dir]][which.second+yy[-dir]]);
}
inline void Push(int which_tu,PII x,PII y){//按压图章
	res.emplace_back(mk(which_tu,x));
	for(R int i=x.first;i<=y.first;++i){
		for(R int j=x.second;j<=y.second;++j){
			--ed.cnt[ed.a[i][j]];ed.a[i][j]=0;++ed.cnt[0];
		}
	}
}
inline bool can(int which_tu){//判断能否盖这个章
	int sum=0,sum2=0;
	for(R int i=1;i<range;++i){
		if(tu[which_tu].cnt[i]>=ed.cnt[i])sum+=tu[which_tu].cnt[i]-ed.cnt[i];
		if(ed.cnt[i]&&tu[which_tu].cnt[i]){
			sum2=1;//需要用上
		}
	}
	return (sum2&&(sum<=ed.cnt[0]));//缺的能用通配符插入且有必要盖
}
int edx,edy;
inline void swap_(int sx,int sy,int ex,int ey,int opt){
	if(sy>ey){
		while(sx<ex)Swap(mk(sx,sy),-3),++sx;
		while(sx>ex)Swap(mk(sx,sy),-4),--sx;
		while(sy<ey)Swap(mk(sx,sy),-1),++sy;
		while(sy>ey)Swap(mk(sx,sy),-2),--sy;
	}else{
		while(sy<ey)Swap(mk(sx,sy),-1),++sy;
		while(sy>ey)Swap(mk(sx,sy),-2),--sy;
		while(sx<ex)Swap(mk(sx,sy),-3),++sx;
		while(sx>ex)Swap(mk(sx,sy),-4),--sx;
	}
}
inline void output(Matrix x){
	for(R int i=1;i<=n;++i){
		for(R int j=1;j<=m;++j){
			cerr<<ed.to_ch(ed.a[i][j])<<' ';
		}
		cerr<<'\n';
	}
	cerr<<'\n';
}
inline void SWAP(PII x,PII y){//不影响原局面的情况下交换两个点
	swap_(x.first,x.second,y.first,y.second,1);
}
inline void turn_to(int which_tu){//将某一个图章凑齐
	for(R int i=1;i<=tu[which_tu].h;++i){
		for(R int j=1;j<=tu[which_tu].w;++j){
			if(ed.a[i][j]!=tu[which_tu].a[i][j]){//不一样
				bool fl=0;
				for(R int l=1;l<=n;++l){
					if(fl)break;
					for(R int o=1;o<=m;++o){
						if(l<=tu[which_tu].h&&o<=tu[which_tu].w)continue;
						if(ed.a[l][o]==tu[which_tu].a[i][j]){
							fl=1;SWAP(mk(l,o),mk(i,j));break;
						}
					}
				}
				if(!fl){
					for(R int l=1;l<=tu[which_tu].h;++l){
						if(fl)break;
						for(R int o=1;o<=tu[which_tu].w;++o){
							if(l<=i&&o<=j)continue;//已经排好了,不能动
							if(ed.a[l][o]==tu[which_tu].a[i][j]){
								fl=1;SWAP(mk(l,o),mk(i,j));break;
							}
						}
					}
				}
				if(!fl){//只能找*
					for(R int l=1;l<=n;++l){
						if(fl)break;
						for(R int o=1;o<=m;++o){
							if(l<=tu[which_tu].h&&o<=tu[which_tu].w)continue;
							if(ed.a[l][o]==0){
								fl=1;SWAP(mk(l,o),mk(i,j));break;
							}
						}
					}
				}
				if(!fl){
					for(R int l=1;l<=tu[which_tu].h;++l){
						if(fl)break;
						for(R int o=1;o<=tu[which_tu].w;++o){
							if(l<=i&&o<=j)continue;//已经排好了,不能动
							if(ed.a[l][o]==0){
								fl=1;SWAP(mk(l,o),mk(i,j));break;
							}
						}
					}
				}
			}
		}
	}
	// output(ed);
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cin>>n>>m>>k;st.h=ed.h=n,st.w=ed.w=m;
	st.getmat(),ed.getmat();tu[0].h=n,tu[0].w=m;
	for(R int i=1;i<=n;++i){
		for(R int j=1;j<=m;++j){
			tu[0].a[i][j]=st.a[i][j];
		}
	}
	for(R int i=0;i<range;++i)tu[0].cnt[i]=st.cnt[i];
	for(R int i=1;i<=k;++i){cin>>tu[i].h>>tu[i].w;tu[i].getmat();}
	while(1){
		bool fl=0;
		for(R int i=1;i<=k;++i){
			if(can(i)){
				fl=1;
				// cerr<<i<<'\n';
				// output(ed);
				turn_to(i);Push(i,mk(1,1),mk(tu[i].h,tu[i].w));
				// output(ed);
			}
		}
		if(!fl)break;
	}
	int sum=0;
	for(R int i=1;i<range;++i){
		if(st.cnt[i]!=ed.cnt[i]){
			if(st.cnt[i]>ed.cnt[i]){
				sum+=st.cnt[i]-ed.cnt[i];
			}
			if(ed.cnt[i]>st.cnt[i])sum=-2147483647;
		}
	}
	if(sum<ed.cnt[0]){
		cout<<"-1\n";
		return 0;
	}
	if(can(0))turn_to(0);
	int len=res.size();
	cout<<len<<'\n';
	for(R int i=len-1;i>=0;--i)cout<<res[i].first<<' '<<res[i].second.first<<' '<<res[i].second.second<<'\n';
    return 0;
}