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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define subnb true
#define Lnb true
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

namespace fft {
    using dbl = long double;
    struct num {
        dbl x, y;
        num(dbl x_ = 0, dbl y_ = 0) : x(x_), y(y_) {}
    };
    inline num operator+(num a, num b) {return num(a.x + b.x, a.y + b.y);}
    inline num operator-(num a, num b) {return num(a.x - b.x, a.y - b.y);}
    inline num operator*(num a, num b) {return num(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x);}
    inline num conj(num a) {return num(a.x, -a.y);}
    inline num inv(num a) {dbl n = (a.x * a.x + a.y * a.y); return num(a.x / n, -a.y / n);}

    using vn = vector<num>;
    vi rev({0, 1});
    vn rt(2, num(1)), fa, fb;

    inline void init(int n) {
        if(n <= sz(rt)) return ;
        rev.resize(n);
        rep(i, 0, n) rev[i] = (rev[i >> 1] | ((i & 1) * n)) >> 1;
        rt.reserve(n);
        for (int k = sz(rt); k < n; k *= 2) {
            rt.resize(2 * k);
            double a = M_PI / k; num z(cos(a), sin(a));
            rep(i, k / 2, k) rt[2 * i] = rt[i], rt[2 * i + 1] = rt[i] * z;
        }
    }

    inline void fft(vector<num> &a, int n) {
        init(n);
        int s = __builtin_ctz(sz(rev) / n);
        rep(i, 0, n) if(i < rev[i] >> s) swap(a[i], a[rev[i] >> s]);
        for (int k = 1; k < n; k *= 2) {
            for (int i = 0; i < n; i += 2 * k) rep(j, 0, k) {
                num t = rt[j + k] * a[i + j + k];
                a[i + j + k] = a[i + j] - t;
                a[i + j] = a[i + j] + t;
            }
        }
    }

    vn multiply(vn a, vn b) {
        int s = sz(a) + sz(b) - 1;
        if(s <= 0) return {};
        int L = s > 1 ? 32 - __builtin_clz(s - 1) : 0, n = 1 << L;
        a.resize(n), b.resize(n);
        fft(a, n);
        fft(b, n);
        num d = inv(num(n));
        rep(i, 0, n) a[i] = a[i] * b[i] * d;
        reverse(a.begin() + 1, a.end());
        fft(a, n);
        a.resize(s);
        return a;
    }
}

using fft::num;
using poly = fft::vn;

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

//    poly a(3, {1, 0}), b(3, {1, 0});
//    auto x = fft::multiply(a, b);
//
//    rep(i, 0, sz(x)) {
//        cout << x[i].x << " ";
//    }
//    cout << endl;

    int np, mp, n, m;
    cin >> np >> mp;
    vector<vi> a(np, vi(mp));
    ll csum = 0;
    rep(i, 0, np) rep(j, 0, mp) {
        cin >> a[i][j];
        csum += 1LL * a[i][j] * a[i][j] * a[i][j];
    }
    cin >> n >> m;
    vector<vi> b(n, vi(m));
    rep(i, 0, n) rep(j, 0, m) cin >> b[i][j];

    if(np > n || mp > m) {
        cout << 0 << '\n';
        return 0;
    }
    vector<ll> res(n * m, csum);
    rep(it, 0, 2) {
        poly ps(np * m, {0, 0});
        rep(i, 0, np) {
            rep(j, 0, mp) {
                if(it == 0) ps[i * m + j] = {(ld)a[i][j] * a[i][j], (ld)0};
                else ps[i * m + j] = {(ld)a[i][j], (ld)0};
            }
        }
        reverse(all(ps));
        poly pp(n * m, {0, 0});
        rep(i, 0, n) {
            rep(j, 0, m) {
                if(it == 0) pp[i * m + j] = {(ld)b[i][j], 0};
                else pp[i * m + j] = {(ld)b[i][j] * b[i][j], 0};
            }
        }
        poly cur = fft::multiply(ps, pp);
        rep(i, 0, n * m) {
            int idx = i + np * m - 1;
            if(it == 0) res[i] -= 2 * (ll)(cur[idx].x + 0.5);
            else res[i] += (ll)(cur[idx].x + 0.5);
        }
    }
    vector<pii> ps;
    rep(i, 0, n - np + 1) {
        rep(j, 0, m - mp + 1) {
            if(res[i * m + j] == 0) ps.push_back({i, j});
        }
    }
    cout << sz(ps) << '\n';
    for (auto p : ps) cout << p.first + 1 << " " << p.second + 1 << '\n';



}