#include <bits/stdc++.h>
using namespace std;

typedef pair <int, int> pii;

const int md = 998244353;

inline int add(int x, int y) {
	if (x + y >= md) return x + y - md;
	return x + y;
}

inline int sub(int x, int y) {
	if (x < y) return x - y + md;
	return x - y;
}

inline int mul(int x, int y) {
	return 1ull * x * y % md;
}

inline int fpow(int x, int y) {
	int ans = 1;
	while (y) {
		if (y & 1) ans = mul(ans, x);
		y >>= 1; x = mul(x, x);
	}
	return ans;
}

namespace Poly {
	vector <int> roots, rev;
	
	void getRevRoot(int base) {
		int n = 1 << base;
		if ((int)roots.size() == n) return;
		roots.resize(n); rev.resize(n);
		for (int i = 1; i < n; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (base - 1));
		for (int mid = 1; mid < n; mid <<= 1) {
			int wn = fpow(3, (md - 1) / (mid << 1));
			roots[mid] = 1;
			for (int i = 1; i < mid; i++) roots[mid + i] = mul(roots[mid + i - 1], wn);
		}
	}
	
	void ntt(vector <int> &a, int base) {
		int n = 1 << base;
		for (int i = 0; i < n; i++) {
			if (rev[i] > i) {
				swap(a[i], a[rev[i]]);
			}
		}
		for (int mid = 1; mid < n; mid <<= 1) {
			for (int i = 0; i < n; i += (mid << 1)) {
				for (int j = 0; j < mid; j++) {
					int x = a[i + j], y = mul(roots[mid + j], a[i + j + mid]);
					a[i + j] = add(x, y); a[i + j + mid] = sub(x, y);
				}
			}
		}
	}
	
	vector <int> operator * (vector <int> a, vector <int> b) {
		int n = (int)a.size() + (int)b.size() - 1, base = 0;
		while ((1 << base) < n) ++base;
		a.resize(1 << base); b.resize(1 << base);
		getRevRoot(base); ntt(a, base); ntt(b, base);
		for (int i = 0; i < (1 << base); i++) a[i] = mul(a[i], b[i]);
		ntt(a, base); reverse(a.begin() + 1, a.end());
		int inv = fpow(1 << base, md - 2);
		for (int i = 0; i < n; i++) a[i] = mul(a[i], inv);
		a.resize(n);
		return a;
	}
}

using Poly::operator *;

const int N = 1005, T = 2;

int a[N][N], b[N][N], ans[N][N], w[N], iw[N];
vector <int> f, g, h;
int n1, m1, n2, m2, cnt;

mt19937 rng(123);

int main() {
	scanf("%d%d", &n1, &m1);
	for (int i = 0; i < n1; i++) {
		for (int j = 0; j < m1; j++) {
			scanf("%d", &a[i][j]);
			if (a[i][j]) ++cnt;
		}
	}
	scanf("%d%d", &n2, &m2);
	for (int i = 0; i < n2; i++) {
		for (int j = 0; j < m2; j++) {
			scanf("%d", &b[i][j]);
		}
	}
	g.resize(n2 * m2);
	for (int _ = 1; _ <= T; _++) {
		f.clear(); f.resize(n1 * m2);
		for (int i = 1; i <= 100; i++) {
			w[i] = rng() % (md - 1) + 1;
			iw[i] = fpow(w[i], md - 2);
		}
		for (int i = 0; i < n1; i++) {
			for (int j = 0; j < m1; j++) {
				f[i * m2 + j] = w[a[i][j]];
			}
		}
		for (int i = 0; i < n2; i++) {
			for (int j = 0; j < m2; j++) {
				g[i * m2 + j] = iw[b[i][j]];
			}
		}
		reverse(f.begin(), f.end());
		h = f * g;
		for (int i = 0; i <= n2 - n1; i++) {
			for (int j = 0; j <= m2 - m1; j++) {
				if (h[i * m2 + j + (int)f.size() - 1] == cnt) {
					++ans[i][j];
				}
			}
		}
	}
	vector <pii> res;
	for (int i = 0; i <= n2 - n1; i++) {
		for (int j = 0; j <= m2 - m1; j++) {
			if (ans[i][j] == T) {
				res.emplace_back(i, j);
			}
		}
	}
	printf("%d\n", (int)res.size());
	for (auto i : res) printf("%d %d\n", i.first + 1, i.second + 1);
	return 0;
}