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

#ifdef LOCAL
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
/**
 * Author: chilli
 * Date: 2019-04-16
 * License: CC0
 * Source: based on KACTL's FFT
 * Description: ntt(a) computes $\hat f(k) = \sum_x a[x] g^{xk}$ for all $k$, where $g=\text{root}^{(mod-1)/N}$.
 * N must be a power of 2.
 * Useful for convolution modulo specific nice primes of the form $2^a b+1$,
 * where the convolution result has size at most $2^a$. For arbitrary modulo, see FFTMod.
   \texttt{conv(a, b) = c}, where $c[x] = \sum a[i]b[x-i]$.
   For manual convolution: NTT the inputs, multiply
   pointwise, divide by n, reverse(start+1, end), NTT back.
 * Inputs must be in [0, mod).
 * Time: O(N \log N)
 * Status: stress-tested
 */
const ll mod = (119 << 23) + 1, root = 62; // = 998244353
ll add(ll a, ll b) { return a+b>=mod ? a+b-mod : a+b; }
ll mul(ll a, ll b) { return a*b%mod; }
ll modpow(ll b, ll e) {
    ll ans = 1;
    for (; e; b = b * b % mod, e /= 2)
        if (e & 1) ans = ans * b % mod;
    return ans;
}

// For p < 2^30 there is also e.g. 5 << 25, 7 << 26, 479 << 21
// and 483 << 21 (same root). The last two are > 10^9.
typedef vector<ll> vl;
void ntt(vl &a) {
    int n = sz(a), L = 31 - __builtin_clz(n);
    static vl rt(2, 1);
    for (static int k = 2, s = 2; k < n; k *= 2, s++) {
        rt.resize(n);
        ll z[] = {1, modpow(root, mod >> s)};
        rep(i,k,2*k) rt[i] = rt[i / 2] * z[i & 1] % mod;
    }
    vi rev(n);
    rep(i,0,n) rev[i] = (rev[i / 2] | (i & 1) << 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) {
            ll z = rt[j + k] * a[i + j + k] % mod, &ai = a[i + j];
            a[i + j + k] = ai - z + (z > ai ? mod : 0);
            ai += (ai + z >= mod ? z - mod : z);
        }
}

vl conv(const vl &a, const vl &b) {
    if (a.empty() || b.empty()) return {};
    int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s), n = 1 << B;
    int inv = modpow(n, mod - 2);
    vl L(a), R(b), out(n);
    L.resize(n), R.resize(n);
    ntt(L), ntt(R);
    rep(i,0,n) out[-i & (n - 1)] = (ll)L[i] * R[i] % mod * inv % mod;
    ntt(out);
    return {out.begin(), out.begin() + s};
}

mt19937 rng(192755222);
const int N = 2048;
int mp[202];
bitset<N> good[N];

vl to_poly(vector<vi> vec) {
    assert(sz(vec) > 0);
    int n = sz(vec), m = sz(vec[0]);
    vl ans(N*N);
    rep(i, 0, n) rep(j, 0, m) {
        ans[i*N+j] = mp[vec[i][j]];
    }
    while(ans.back() == 0) ans.pop_back();
    return ans;
}

vl to_poly_rev(vector<vi> vec) {
    assert(sz(vec) > 0);
    int n = sz(vec), m = sz(vec[0]);
    vl ans(N*N);
    rep(i, 0, n) rep(j, 0, m) {
        ans[(N/2-i)*N+(N/2-j)] = mp[vec[i][j]];
    }
    while(ans.back() == 0) ans.pop_back();
    return ans;
}

int main() {
    int n, m, p, q;
    scanf("%d%d", &n, &m);
    vector<vi> a(n, vector<int>(m));
    for(auto &vec: a) {
        for(auto &v: vec) {
            scanf("%d", &v);
        }
    }

    scanf("%d%d", &p, &q);
    vector<vi> b(p, vector<int>(q));
    for(auto &vec: b) {
        for(auto &v: vec) {
            scanf("%d", &v);
        }
    }

    for(int i = 0; i < p-n+1; i++) {
        for(int j = 0; j < q-m+1; j++) {
            good[i][j] = true;
        }
    }
    
    rep(_, 0, 4) {
        mp[0] = 0;
        for(int i = 1; i < 202; i++) {
            mp[i] = rng() % mod;
        }
        vl A = to_poly_rev(a), B = to_poly(b);
        debug(sz(A), sz(B));
        
        ll sqr = 0;
        for(auto g: A) sqr = add(sqr, mul(g, g));

        vl C = conv(A, B);
        // debug(C);
        // debug(A,B,C);
        for(int i = 0; i < sz(C); i++) {
            int x = i / N - (N/2), y = i % N - (N/2);
            if(x >= 0 && y >= 0 && x < p-n+1 && y < q-m+1) {
                debug(x,y,C[i]);
                good[x][y] = good[x][y] && (C[i] == sqr);
            }
        }
    }

    vector<pii> ans;
    for(int i = 0; i < p-n+1; i++) {
        for(int j = 0; j < q-m+1; j++) if(good[i][j]) {
            ans.emplace_back(i, j);
        }
    }
    
    cout << sz(ans) << '\n';
    for(auto [i,j]: ans) {
        cout << i+1 << ' ' << j+1 << '\n';
    }
    return 0;
}