#include <bits/stdc++.h> 

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 998244353;

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}
int mult(int a, int b)
{
	return (LL)a * b % mod;
}
int binpow(int a, int n)
{
	int res = 1;
	while (n)
	{
		if (n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

const int LEN = 1 << 23;
const int GEN = 31;
const int IGEN = binpow(GEN, mod - 2);


VI mult(VI a, int k)
{
	VI res = a;
	FOR(i, 0, SZ(a))
		res[i] = mult(a[i], k);
	return res;
}
VI add(VI a, VI b)
{
	assert(SZ(a) == SZ(b));
	
	VI res(SZ(a));
	FOR(i, 0, SZ(a))
		res[i] = add(a[i], b[i]);
	return res;
}
VI sub(VI a, VI b)
{
	assert(SZ(a) == SZ(b));
	
	VI res(SZ(a));
	FOR(i, 0, SZ(a))
		res[i] = sub(a[i], b[i]);
	return res;	
}
VI mult(VI a, VI b)
{
	assert(SZ(a) == SZ(b));
	
	VI res(SZ(a));
	FOR(i, 0, SZ(a))
		res[i] = mult(a[i], b[i]);
	return res;
}


template<class T>
void fft(vector<T>& a, bool inv)
{
	int lg = __builtin_ctz(SZ(a));
	FOR(i, 0, SZ(a))
	{
		int k = 0;
		FOR(j, 0, lg)
			k |= ((i >> j) & 1) << (lg - j - 1);
		if (i < k)
			swap(a[i], a[k]);
	}
	for (int len = 2; len <= SZ(a); len *= 2)
	{
		int ml = binpow(inv ? IGEN : GEN, LEN / len);
		for (int i = 0; i < SZ(a); i += len)
		{
			int pw = 1;
			FOR(j, 0, len / 2)
			{
				auto v = a[i + j];
				auto u = mult(a[i + j + len / 2], pw);
				a[i + j] = add(v, u);
				a[i + j + len / 2] = sub(v, u);
				pw = mult(pw, ml);
			}
		}
	}
	if (inv)
	{
		int m = binpow(SZ(a), mod - 2);
		FOR(i, 0, SZ(a))
			a[i] = mult(a[i], m);
	}
}

VI multFFT(VI a, VI b)
{
	int sz = 0;
	int sum = SZ(a) + SZ(b) - 1;
	while ((1 << sz) < sum)
		sz++;
	a.resize(1 << sz);
	b.resize(1 << sz);
	fft(a, false);
	fft(b, false);
	FOR(i, 0, SZ(a))
		a[i] = mult(a[i], b[i]);
	fft(a, true);
	a.resize(sum);
	return a;
}

vector<VI> multFFT2D(vector<VI> a, vector<VI> b)
{
	int szX = 0;
	int sumX = SZ(a) + SZ(b) - 1;
	while ((1 << szX) < sumX)
		szX++;
	a.resize(1 << szX);
	b.resize(1 << szX);

	int szY = 0;
	int sumY = SZ(a[0]) + SZ(b[0]) - 1;
	while ((1 << szY) < sumY)
		szY++;
	
	FOR(i, 0, 1 << szX)
	{
		while(SZ(a[i]) < (1 << szY))
			a[i].PB(0);
		fft(a[i], false);
		while(SZ(b[i]) < (1 << szY))
			b[i].PB(0);
		fft(b[i], false);
	}
	fft(a, false);
	fft(b, false);
	FOR(i, 0, SZ(a))
		a[i] = mult(a[i], b[i]);
	fft(a, true);
	a.resize(sumX);
	FOR(i, 0, SZ(a))
	{
		fft(a[i], true);
		a[i].resize(sumY);
	}
	return a;
}


vector<VI> read(int n, int m)
{
	vector<VI> res(n);
	FOR(i, 0, n)
	{
		res[i].resize(m);
		FOR(j, 0, m)
			cin >> res[i][j];
	}
	return res;
}

bool hasBit(int mask, int bit)
{
	return (mask >> bit) & 1;
}



int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n0, m0;
	cin >> n0 >> m0;
	auto motif = read(n0, m0);


	int n1, m1;
	cin >> n1 >> m1;
	auto mosaic = read(n1, m1);
	
	if(n0 > n1 || m0 > m1)
	{
		cout << "0\n";
		return 0;
	}
	
	vector<VI> ans(n1 - n0 + 1);
	FOR(i, 0, SZ(ans))
	{
		ans[i].assign(m1 - m0 + 1, 1);
	}
	
	FOR(bit, 0, 7)
	{
		FOR(t, 0, 2)
		{
			vector<VI> a = motif;
			FOR(i, 0, n0)
			{
				FOR(j, 0, m0)
				{
					if(motif[n0 - 1 - i][m0 - 1 - j] != 0)
						a[i][j] = (hasBit(motif[n0 - 1 - i][m0 - 1 - j], bit) == t);
					else
						a[i][j] = 0;
				}
			}
			vector<VI> b = mosaic;
			FOR(i, 0, n1)
			{
				FOR(j, 0, m1)
				{
					b[i][j] = (hasBit(mosaic[i][j], bit) != t);
				}
			}
			auto res = multFFT2D(a, b);
			
			FOR(i, 0, SZ(ans))
			{
				FOR(j, 0, SZ(ans[0]))
				{
					ans[i][j] &= res[i + n0 - 1][j + m0 - 1] == 0;
				}
			}
		}
	}
	vector<PII> out;
	FOR(i, 0, SZ(ans))
	{
		FOR(j, 0, SZ(ans[0]))
		{
			if(ans[i][j])
				out.PB({i, j});
		}
	}
	cout << SZ(out) << "\n";
	for(auto [x, y] : out)
		cout << x + 1 << " " << y + 1 << "\n";
	return 0;
}