#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

const double pi = acos(-1);
const double eps = 1e-9;

struct point {
	double x, y;
	point(double x = 0, double y = 0) : x(x), y(y) {}
};

point operator+(const point &a, const point &b) {
	return {a.x + b.x, a.y + b.y};
}
point operator-(const point &a, const point &b) {
	return {a.x - b.x, a.y - b.y};
}
point operator*(const point &a, const point &b) {
	return {a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x};
}
point operator/(const point &a, double d) { return {a.x / d, a.y / d}; }

void fft(vector<point> &a, int sign = 1) {
	int n = a.size(); // n should be a power of two
	double theta = 8 * sign * atan(1.0) / n;
	for (int i = 0, j = 1; j < n - 1; ++j) {
		for (int k = n >> 1; k > (i ^= k); k >>= 1)
			;
		if (j < i)
			swap(a[i], a[j]);
	}
	for (int m, mh = 1; (m = mh << 1) <= n; mh = m) {
		int irev = 0;
		for (int i = 0; i < n; i += m) {
			point w = point(cos(theta * irev), sin(theta * irev));
			for (int k = n >> 2; k > (irev ^= k); k >>= 1)
				;
			for (int j = i; j < mh + i; ++j) {
				int k = j + mh;
				point x = a[j] - a[k];
				a[j] = a[j] + a[k];
				a[k] = w * x;
			}
		}
	}
	if (sign == -1)
		for (auto &p : a)
			p = point(p.x / n, p.y / n);
}

vector<point> convolve(vector<point> &a, vector<point> &b) {
	int n = a.size(), m = b.size(), sum = n + m;

	while (sum != (sum & -sum))
		sum += (sum & -sum);
	while (a.size() < sum)
		a.push_back(point(0, 0));
	while (b.size() < sum)
		b.push_back(point(0, 0));

	fft(a, 1);
	fft(b, 1);

	vector<point> res(sum);
	for (int i = 0; i < sum; i++)
		res[i] = a[i] * b[i];

	fft(res, -1);

	return res;
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);

	int rp, cp;
	cin >> rp >> cp;
	vector<vector<int>> motif(rp, vector<int>(cp));
	for (int i = 0; i < rp; i++)
		for (int j = 0; j < cp; j++)
			cin >> motif[i][j];
	int rq, cq;
	cin >> rq >> cq;
	vector<vector<int>> mosaic(rq, vector<int>(cq));
	for (int i = 0; i < rq; i++)
		for (int j = 0; j < cq; j++)
			cin >> mosaic[i][j];

	if (rp > rq || cp > cq) {
		cout << "0\n";
		return 0;
	}

	vector<point> p(rq * cq), q(rq * cq);
	int target = 0;
	for (int i = 0; i < rp; i++)
		for (int j = 0; j < cp; j++) {
			if (!motif[i][j])
				continue;
			double angle = (pi * motif[i][j]) / 100;
			p[(rp - i - 1) * cq + (cp - j - 1)] = point(cos(angle), sin(angle));
			target++;
		}
	for (int i = 0; i < rq; i++)
		for (int j = 0; j < cq; j++) {
			double angle = (-pi * mosaic[i][j]) / 100;
			q[i * cq + j] = point(cos(angle), sin(angle));
		}

	vector<point> results = convolve(p, q);
	vector<pii> ans;
	for (int i = 0; i + rp <= rq; i++)
		for (int j = 0; j + cp <= cq; j++) {
			int index_to_check = (i + rp - 1) * cq + (j + cp - 1);
			if (abs(results[index_to_check].x - target) < eps)
				ans.push_back(pii(i + 1, j + 1));
		}

	cout << ans.size() << "\n";
	for (auto pos : ans)
		cout << pos.first << ' ' << pos.second << "\n";

	return 0;
}