#include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353, W = 20, S = 1 << W;
using int64 = long long; mt19937 rnd(0x66ccff);
int w[S], mp[S], mq[S], x[107], x2[107], g[1007][1007];
int Ub(int x) { return 2 << (31 ^ __builtin_clz(x - 1)); }
void InitOmega(int N) {
    static int tb[23]; int64 rt = 31;
    for(int i = 22; i >= 0; --i)
        tb[i] = (int)rt, rt = rt * rt % Mod;
    for(int L = 1, p = 0; L < N; L <<= 1) {
        int64 t = 1; const int q = tb[p++];
        for(int i = 0; i < L; ++i)
            w[L + i] = (int)t, t = t * q % Mod;
    }
}
void NTT(int *A, int N) {
    const auto trans = [&](int i, int j, int L) {
        const int u = A[i + j], v = A[i + j + L];
        A[i + j] = u + v >= Mod ? u + v - Mod : u + v;
        A[i + j + L] = 1ll * (u + Mod - v) * w[L + j] % Mod;
    };
    for(int L = N >> 1; L; L >>= 1)
        for(int i = 0; i < N; i += (L << 1))
            for(int j = 0; j < L; ++j) trans(i, j, L);
}
void INTT(int *A, int N) {
    const auto trans = [&](int i, int j, int L) {
        const int u = A[i + j], v = 1ll * w[L + j] * A[i + j + L] % Mod;
        A[i + j] = u + v >= Mod ? u + v - Mod : u + v;
        A[i + j + L] = u - v >= 0 ? u - v : u + Mod - v;
    };
    for(int L = 1; L < N; L <<= 1)
        for(int i = 0; i < N; i += (L << 1))
            for(int j = 0; j < L; ++j) trans(i, j, L);
    reverse(A + 1, A + N); const int64 iv = Mod - (Mod - 1) / N;
    for(int i = 0; i < N; ++i) A[i] = (int)(A[i] * iv % Mod);
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int rp, cp; cin >> rp >> cp;
    for(int i = 0; i < rp; ++i)
        for(int j = 0; j < cp; ++j) cin >> g[i][j];
    int rq, cq; cin >> rq >> cq;
    for(int i = 0; i < rq * cq; ++i) cin >> mq[i];
    if(rp > rq || cp > cq) return puts("0"), 0;
    const int n = cp + (rp - 1) * cq, m = rq * cq;
    for(int i = 0; i < rp; ++i)
        for(int j = 0; j < cp; ++j) mp[i * cq + j] = g[i][j];
    for(int i = 1; i <= 100; ++i) x[i] = rnd() % Mod;
    for(int i = 1; i <= 100; ++i) x2[i] = 1ll * x[i] * x[i] % Mod;
    const auto &sum2 = [&](int *bg, int *ed, long long init = 0) {
        while(bg != ed) init += x2[*bg], *bg = x[*bg], ++bg; return init; };
    const int tg = sum2(mp, mp + n) % Mod, N = Ub(m);
    for(int i = 0; i < m; ++i) mq[i] = x[mq[i]];
    reverse(mp, mp + n), InitOmega(N), NTT(mp, N), NTT(mq, N);
    for(int i = 0; i < N; ++i) mp[i] = 1ll * mp[i] * mq[i] % Mod;
    INTT(mp, N); vector<pair<int, int>> ans;
    for(int i = 0; i + rp <= rq; ++i)
        for(int j = 0; j + cp <= cq; ++j)
            if(tg == mp[i * cq + j + n - 1])
                ans.emplace_back(i + 1, j + 1);
    printf("%d\n", (int)ans.size());
    for(const auto [x, y] : ans) printf("%d %d\n", x, y);
}