#include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
typedef long double ld;
#define double ld
typedef std::complex<double> cpx;
const int INF = (int)1e9 + 7;

using namespace std;

template <typename T>
vector<T> operator+ (const vector<T> &x, const vector<T> &y)
{
	int n = x.size();
	vector<T> ret(n);
	for(int i = 0; i < n; ++i) ret[i] = x[i] + y[i];
	return ret;
}
template <typename T>
vector<T> operator- (const vector<T> &x, const vector<T> &y)
{
	int n = x.size();
	vector<T> ret(n);
	for(int i = 0; i < n; ++i) ret[i] = x[i] - y[i];
	return ret;
}
template <typename T1, typename T2>
vector<T1> operator* (const vector<T1> &x, T2 y)
{
	int n = x.size();
	vector<T1> ret(n);
	for(int i = 0; i < n; ++i) ret[i] = x[i] * y;
	return ret;
}
vector<cpx> conj(vector<cpx> V)
{
	for(auto &i : V) i = conj(i);
	return V;
}

const double pi = acos(-1);
int M, B;
vector<int> rev;
vector<cpx> w;

void init(int _B)
{
	B = _B;
	M = 1 << B;
	w.resize(M);
	rev.resize(M);
	for(int i = 0; i < M; ++i)
	{
		w[i] = { cos(pi * i / M), sin(pi * i / M) };
		rev[i] = (rev[i / 2] >> 1) | ((i & 1) << (B - 1));
	}
}

template <typename T>
void dft(vector<T> &F, bool inv)
{
	int n = F.size();
	int b = __lg(n);
	for(int i = 0; i < n; ++i)
	{
		int p = rev[i] >> (B - b);
		if(i < p) swap(F[i], F[p]);
	}
	for(int d = 1; d < n; d *= 2)
	{
		for(int i = 0; i < n; i += 2 * d)
		{
			for(int j = 0; j < d; ++j)
			{
				T a = F[i + j];
				T b = F[i + j + d] * (inv ? conj(w[M / d * j]) : w[M / d * j]);
				F[i + j] = a + b;
				F[i + j + d] = a - b;
			}
		}
	}
	if(inv) for(int i = 0; i < n; ++i) F[i] = F[i] * (double(1) / n);
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int a, b; cin >> a >> b;
	int A[a][b];
	for(auto &i : A) for(auto &j : i) cin >> j;
	int c, d; cin >> c >> d;
	int B[c][d];
	for(auto &i : B) for(auto &j : i) cin >> j;

	int n = 1, m = 1;
	while(n < a + c) n <<= 1;
	while(m < b + d) m <<= 1;
	init(15);

	vector<vector<cpx>> X(n, vector<cpx>(m));
	vector<vector<cpx>> Y(n, vector<cpx>(m));
	vector<vector<cpx>> Z(n, vector<cpx>(m));
	vector<vector<cpx>> WX(n, vector<cpx>(m));
	vector<vector<cpx>> WY(n, vector<cpx>(m));
	vector<vector<cpx>> WZ(n, vector<cpx>(m));
	for(int i = 0; i < a; ++i) for(int j = 0; j < b; ++j) X[i][j].real(A[a - i - 1][b - j - 1] * A[a - i - 1][b - j - 1] * A[a - i - 1][b - j - 1]);
	for(int i = 0; i < c; ++i) for(int j = 0; j < d; ++j) X[i][j].imag(B[i][j]);
	for(int i = 0; i < a; ++i) for(int j = 0; j < b; ++j) Y[i][j].real(A[a - i - 1][b - j - 1] * A[a - i - 1][b - j - 1]);
	for(int i = 0; i < c; ++i) for(int j = 0; j < d; ++j) Y[i][j].imag(B[i][j] * B[i][j]);
	for(int i = 0; i < a; ++i) for(int j = 0; j < b; ++j) Z[i][j].real(A[a - i - 1][b - j - 1]);
	for(int i = 0; i < c; ++i) for(int j = 0; j < d; ++j) Z[i][j].imag(B[i][j] * B[i][j] * B[i][j]);
	
	dft(X, false); for(auto &i : X) dft(i, false);
	dft(Y, false); for(auto &i : Y) dft(i, false);
	dft(Z, false); for(auto &i : Z) dft(i, false);

	for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j)
	{
		int _i = (n - i) % n;
		int _j = (m - j) % m;
		cpx p = (X[i][j] + conj(X[_i][_j])) * cpx(0.5, 0);
		cpx q = (X[i][j] - conj(X[_i][_j])) * cpx(0, -0.5);
		WX[i][j] = p * q;
	}
	for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j)
	{
		int _i = (n - i) % n;
		int _j = (m - j) % m;
		cpx p = (Y[i][j] + conj(Y[_i][_j])) * cpx(0.5, 0);
		cpx q = (Y[i][j] - conj(Y[_i][_j])) * cpx(0, -0.5);
		WY[i][j] = cpx(-2.0, 0) * p * q;
	}
	for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j)
	{
		int _i = (n - i) % n;
		int _j = (m - j) % m;
		cpx p = (Z[i][j] + conj(Z[_i][_j])) * cpx(0.5, 0);
		cpx q = (Z[i][j] - conj(Z[_i][_j])) * cpx(0, -0.5);
		WZ[i][j] = p * q;
	}

	dft(WX, true); for(auto &i : WX) dft(i, true);
	dft(WY, true); for(auto &i : WY) dft(i, true);
	dft(WZ, true); for(auto &i : WZ) dft(i, true);

	vector<pii> ans;
	for(int i = 0; i < c - a + 1; ++i) for(int j = 0; j < d - b + 1; ++j)
	{
		if((ll)round(WX[i + a - 1][j + b - 1].real())
		 + (ll)round(WY[i + a - 1][j + b - 1].real())
		 + (ll)round(WZ[i + a - 1][j + b - 1].real()) == 0) ans.push_back({i, j});
	}

	// for(int i = 0; i < n; ++i)
	// {
	// 	for(int j = 0; j < m; ++j)
	// 	{
	// 		cout << (ll)round(W[i][j].real()) << ' ';
	// 	}
	// 	cout << endl;
	// }

	cout << ans.size() << '\n';
	for(auto [x, y] : ans) cout << x + 1 << ' ' << y + 1 << '\n';
}