#include<bits/stdc++.h>
using namespace std;
mt19937 mt(time(NULL));
constexpr int N=3e6,M=1005,mod=998244353;
int n0,m0,n,m,num,res,l,lim;vector<pair<int,int>>ans;
int a[N],b[N],rev[N],a0[M][M],idx[M][M],base[M];
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
int qpow(int x,int n){
	int s=1;while (n){
		if (n&1) s=1ll*s*x%mod;
		x=1ll*x*x%mod;n>>=1;
	} return s;
}
int rdc(int x){return x>=mod?x-mod:x;}
void NTT(int *a,int type){
	for (int i=0;i<lim;i++)
		if (rev[i]>i) swap(a[i],a[rev[i]]);
	for (int i=1;i<lim;i<<=1){
		int wn=qpow(3,mod/(i<<1));
		for (int j=0;j<lim;j+=i<<1)
			for (int k=0,w=1,x,y;k<i;w=1ll*w*wn%mod,k++)
				x=a[j+k],y=1ll*a[i+j+k]*w%mod,
				a[j+k]=rdc(x+y),a[i+j+k]=rdc(x-y+mod);
	}
    if (type) return; 
    reverse(a+1,a+lim);int inv=qpow(lim,mod-2);
    for (int i=0;i<lim;i++) a[i]=1ll*a[i]*inv%mod;
}
int main(){
	n0=read();m0=read();
	for (int i=1;i<=100;i++) base[i]=mt()%mod;
	for (int i=1;i<=n0;i++)
		for (int j=1;j<=m0;j++)
			a0[i][j]=base[read()];
	n=read();m=read();
	if (n0>n||m0>m) return puts("0"),0;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			a[idx[i][j]=num++]=base[read()];
	for (int i=1;i<=m;i++) idx[n+1][i]=num++;
	for (int i=1;i<=n0;i++)
		for (int j=1;j<=m0;j++)
			b[idx[i][j]]=a0[i][j];
	reverse(b,b+num);num--;
	for (int i=0;i<=num;i++) res=(res+1ll*b[i]*b[i])%mod;
	lim=1;while (lim<=(num<<1)) lim<<=1,l++;
	for (int i=0;i<lim;i++) rev[i]=rev[i>>1]>>1|(i&1)<<l-1;
	NTT(a,1);NTT(b,1);
	for (int i=0;i<lim;i++) a[i]=1ll*a[i]*b[i]%mod;
	NTT(a,0);
	for (int i=1;i<=n-n0+1;i++)
		for (int j=1;j<=m-m0+1;j++)
			if (a[num+idx[i][j]]==res)
				ans.emplace_back(i,j);
	printf("%d\n",(int)ans.size());
	for (auto [x,y]:ans) printf("%d %d\n",x,y);
	return 0;
}