#include <bits/stdc++.h>
#define sz(a) (int)size(a)
#define rep(i, a, b) for (int i = a; i < b; ++i)

using namespace std;

constexpr int N = 1e3, mod = 998244353, root = 62;

auto& mul(auto&& a, auto b) { return a = a * (uint64_t)b % mod; }
int fpow(int a, int b) { int r = 1; for (; b; b /= 2, mul(a, a)) if (b % 2) mul(r, a); return r; }

using ll = int64_t;
using vi = vector<int>;

int pat[N][N], text[N][N];
uint32_t key[101];

void ntt(vi& a) {
  int n = sz(a), L = 31 - __builtin_clz(n);
  static vi rt(2, 1);
  for (static int k = 2, s = 2; k < n; k *= 2, s++) {
    rt.resize(n);
    int z[]{1, fpow(root, mod >> s)};
    rep(i, k, 2 * k) rt[i] = mul(+rt[i / 2], z[i & 1]);
  }
  vi rev(n);
  rep(i, 0, n) rev[i] = (rev[i / 2] | i % 2 << L) / 2;
  rep(i, 0, n) if (i < rev[i]) swap(a[i], a[rev[i]]);
  for (int k = 1; k < n; k *= 2)
  for (int i = 0; i < n; i += 2 * k)
  rep(j, 0, k) {
    auto z = rt[j + k] * (uint64_t)a[i + j + k];
    tie(a[i + j + k], a[i + j]) = pair{(a[i + j] + mod * (uint64_t)mod - z) % mod, (a[i + j] + z) % mod};
  }
}

void conv(vi& a, vi& b) {
  int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s), n = 1 << B;
  int inv = fpow(n, mod - 2);
  a.resize(n);
  b.resize(n);
  ntt(a), ntt(b);
  rep(i, 1, n / 2) {
    int j = -i & n - 1;
    tie(a[j], a[i]) = pair{mul(mul(+a[i] , b[i]), inv), mul(mul(+a[j] , b[j]), inv)};
  }
  tie(a[0], a[n / 2]) = pair{mul(mul(+a[0] , b[0]), inv), mul(mul(+a[n / 2] , b[n / 2]), inv)};
  ntt(a);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int rp = 1000, cp = 1000, rt = 1000, ct = 1000;
  cin >> rp >> cp;
  for (int i = 0; i < rp; ++i)
  for (int j = 0; j < cp; ++j) cin >> pat[i][j];
  cin >> rt >> ct;
  for (int i = 0; i < rt; ++i)
  for (int j = 0; j < ct; ++j) cin >> text[i][j];
//  assert(rp <= 500 && cp <= 500);
//  assert(rt <= 500 && ct <= 500);
  if (rp > rt || cp > ct) return cout << 0, 0;
  vector<array<int, 2>> matches[2], ans;
  mt19937_64 rng(2313123);
  vi p, t;
  for (int f = 2; f--; ) {
    for (auto& x: key) x = rng() % mod;
    key[0] = 0;
    p.assign(rp * ct, 0);
    t.assign(rt * ct, 0);
    uint64_t targ = 0;
    for (int i = 0; i < rp; ++i)
    for (int j = 0; j < cp; ++j) p[(rp - 1 - i) * ct + (cp - 1 - j)] = key[pat[i][j]], targ += key[pat[i][j]] * (uint64_t)key[pat[i][j]] % mod;
    for (int i = 0; i < rt; ++i)
    for (int j = 0; j < ct; ++j) t[i * ct + j] = key[text[i][j]];
    conv(t, p);
    targ %= mod;
    for (int i = rp - 1; i < rt; ++i)
    for (int j = cp - 1; j < ct; ++j) if (t[i * ct + j] == targ) {
      matches[f].push_back({i, j});
    }
  }
  ans.resize(matches[0].size());
  ans.erase(set_intersection(matches[0].begin(), matches[0].end(), matches[1].begin(), matches[1].end(), ans.begin()), ans.end());
  cout << ans.size() << '\n';
  for (auto& [r, c]: ans) cout << r - rp + 2 << ' ' << c - cp + 2 << '\n';
}