#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

// FFT_MAXN = 2^k
// fft_init() to precalc FFT_MAXN-th roots

typedef double db;
const int FFT_MAXN=(1<<22);
const db pi=acosl(-1.);
struct cp{
	db a,b;
	cp operator+(const cp&y)const{return (cp){a+y.a,b+y.b};}
	cp operator-(const cp&y)const{return (cp){a-y.a,b-y.b};}
	cp operator*(const cp&y)const{return (cp){a*y.a-b*y.b,a*y.b+b*y.a};}
	cp operator!()const{return (cp){a,-b};};
}nw[FFT_MAXN+1];int bitrev[FFT_MAXN];
void dft(cp*a,int n,int flag=1){
	int d=0;while((1<<d)*n!=FFT_MAXN)d++;
	rep(i,0,n)if(i<(bitrev[i]>>d))swap(a[i],a[bitrev[i]>>d]);
	for (int l=2;l<=n;l<<=1){
		int del=FFT_MAXN/l*flag;
		for (int i=0;i<n;i+=l){
			cp *le=a+i,*ri=a+i+(l>>1),*w=flag==1?nw:nw+FFT_MAXN;
			rep(k,0,l>>1){
				cp ne=*ri**w;
				*ri=*le-ne,*le=*le+ne;
				le++,ri++,w+=del;
			}
		}
	}
	if(flag!=1)rep(i,0,n)a[i].a/=n,a[i].b/=n;
}
void fft_init(){
	int L=0;while((1<<L)!=FFT_MAXN)L++;
	bitrev[0]=0;rep(i,1,FFT_MAXN)bitrev[i]=bitrev[i>>1]>>1|((i&1)<<(L-1));
	nw[0]=nw[FFT_MAXN]=(cp){1,0};
	rep(i,0,FFT_MAXN+1)nw[i]=(cp){cos(2*pi/FFT_MAXN*i),sin(2*pi/FFT_MAXN*i)};	//very slow
}

void convo(db*a,int n,db*b,int m,db*c){
	static cp f[FFT_MAXN>>1],g[FFT_MAXN>>1],t[FFT_MAXN>>1];
	int N=2;while(N<=n+m)N<<=1;
	rep(i,0,N)
		if(i&1){
			f[i>>1].b=(i<=n)?a[i]:0.0;
			g[i>>1].b=(i<=m)?b[i]:0.0;
		}else{
			f[i>>1].a=(i<=n)?a[i]:0.0;
			g[i>>1].a=(i<=m)?b[i]:0.0;
		}
	dft(f,N>>1);dft(g,N>>1);
	int del=FFT_MAXN/(N>>1);
	cp qua=(cp){0,0.25},one=(cp){1,0},four=(cp){4,0},*w=nw;
	rep(i,0,N>>1){
		int j=i?(N>>1)-i:0;
		t[i]=(four*!(f[j]*g[j])-(!f[j]-f[i])*(!g[j]-g[i])*(one+*w))*qua;
		w+=del;
	}
	dft(t,N>>1,-1);
	rep(i,0,n+m+1)c[i]=(i&1)?t[i>>1].a:t[i>>1].b;
}

const int N=1010;
int r1,c1,r2,c2,wt[N][N],b[N][N],a[N][N];
ll ret[N][N];
db f1[(1<<22)+10],f2[(1<<22)+10],g[(1<<22)+10];
int main() {
	scanf("%d%d",&r1,&c1);
	fft_init();
	per(i,0,r1) per(j,0,c1) {
		scanf("%d",&b[i][j]);
		wt[i][j]=b[i][j]==0?0:1;
	}
	scanf("%d%d",&r2,&c2);
	rep(i,0,r2) rep(j,0,c2) {
		scanf("%d",&a[i][j]);
	}
	if (r1>r2||c1>c2) {
		puts("0");
		return 0;
	}
	int n1=(r1+r2),m1=(c1+c2);
	rep(i,0,r1) rep(j,0,c1) f1[i*m1+j]=wt[i][j];
	rep(i,0,r2) rep(j,0,c2) f2[i*m1+j]=a[i][j]*a[i][j];
	convo(f1,r1*m1,f2,r2*m1,g);
	//rep(i,0,n1*m1) printf("%.10f\n",g[i]); puts("");
	for (int i=0;i+r1<=r2;i++) for (int j=0;j+c1<=c2;j++) {
		ret[i][j]+=(ll)(g[(r1-1+i)*m1+(c1-1+j)]+0.5);
		//printf("%d %d %.1f\n",i,j,g[(r1-1+i)*m1+(c1-1+j)]);
	}
	memset(f1,0,sizeof(f1));
	memset(f2,0,sizeof(f2));
	rep(i,0,r1) rep(j,0,c1) f1[i*m1+j]=wt[i][j]*b[i][j];
	rep(i,0,r2) rep(j,0,c2) f2[i*m1+j]=a[i][j];
	convo(f1,r1*m1,f2,r2*m1,g);
	//rep(i,0,n1*m1) printf("%.10f\n",g[i]); puts("");
	for (int i=0;i+r1<=r2;i++) for (int j=0;j+c1<=c2;j++) {
		ret[i][j]-=2*(ll)(g[(r1-1+i)*m1+(c1-1+j)]+0.5);
		//printf("%d %d %.1f\n",i,j,g[(r1-1+i)*m1+(c1-1+j)]);
	}
	ll s=0;
	rep(i,0,r1) rep(j,0,c1) s+=wt[i][j]*b[i][j]*b[i][j];
	vector<PII> pr;
	for (int i=0;i+r1<=r2;i++) for (int j=0;j+c1<=c2;j++) {
		ret[i][j]+=s;
		if (ret[i][j]==0) {
			pr.pb(mp(i,j));
		}
	}
	printf("%d\n",SZ(pr));
	for (auto x:pr) printf("%d %d\n",x.fi+1,x.se+1);
	//wt[i][j]*(a[i+p][j+q]^2-2*a[i+p][j+q]*b[i][j]+b[i][j]^2)
}