#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
typedef pair<int, int> pii;
const int inf=INT_MAX;
const int maxn=2010;
const int md=998244353;

typedef long long ll;
#define int ll
typedef vector<int> vi;
#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 complex<double> C;
typedef vector<double> vd;
void fft(vector<C>& a) {
    int n = sz(a), L = 31 - __builtin_clz(n);
    static vector<complex<long double>> R(2, 1);
    static vector<C> rt(2, 1);  // (^ 10% faster if double)
    for (static int k = 2; k < n; k *= 2) {
        R.resize(n); rt.resize(n);
        auto x = polar(1.0L, acos(-1.0L) / k);
        rep(i,k,2*k) rt[i] = R[i] = i&1 ? R[i/2] * x : R[i/2];
    }
    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) {
            // C z = rt[j+k] * a[i+j+k]; // (25% faster if hand-rolled)  /// include-line
            auto x = (double *)&rt[j+k], y = (double *)&a[i+j+k];        /// exclude-line
            C z(x[0]*y[0] - x[1]*y[1], x[0]*y[1] + x[1]*y[0]);           /// exclude-line
            a[i + j + k] = a[i + j] - z;
            a[i + j] += z;
        }
}
vd conv(const vd& a, const vd& b) {
    if (a.empty() || b.empty()) return {};
    vd res(sz(a) + sz(b) - 1);
    int L = 32 - __builtin_clz(sz(res)), n = 1 << L;
    vector<C> in(n), out(n);
    copy(all(a), begin(in));
    rep(i,0,sz(b)) in[i].imag(b[i]);
    fft(in);
    for (C& x : in) x *= x;
    rep(i,0,n) out[i] = in[-i & (n - 1)] - conj(in[i]);
    fft(out);
    rep(i,0,sz(res)) res[i] = imag(out[i]) / (4 * n);
    return res;
}
typedef vector<ll> vl;
vl convMod(const vl &a, const vl &b) {
    if (a.empty() || b.empty()) return {};
    vl res(sz(a) + sz(b) - 1);
    int B=32-__builtin_clz(sz(res)), n=1<<B, cut=int(sqrt(md));
    vector<C> L(n), R(n), outs(n), outl(n);
    rep(i,0,sz(a)) L[i] = C((int)a[i] / cut, (int)a[i] % cut);
    rep(i,0,sz(b)) R[i] = C((int)b[i] / cut, (int)b[i] % cut);
    fft(L), fft(R);
    rep(i,0,n) {
        int j = -i & (n - 1);
        outl[j] = (L[i] + conj(L[j])) * R[i] / (2.0 * n);
        outs[j] = (L[i] - conj(L[j])) * R[i] / (2.0 * n) / 1i;
    }
    fft(outl), fft(outs);
    rep(i,0,sz(res)) {
        ll av = ll(real(outl[i])+.5), cv = ll(imag(outs[i])+.5);
        ll bv = ll(imag(outl[i])+.5) + ll(real(outs[i])+.5);
        res[i] = ((av % md * cut + bv) % md * cut + cv) % md;
    }
    return res;
}

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
int rand(int a, int b) {
    return a + rng()%(b-a+1);
}

int modInv(int a, int m)
{
    int m0=m;
    int y=0, x=1;
    if(m==1)
        return 0;
    while(a>1)
    {
        int q=a/m;
        int t=m;
        m=a%m, a=t;
        t=y;
        y=x-q*y;
        x=t;
    }
    if(x<0)
        x+=m0;
    return x;
}

int rp, cp;
int motif[maxn][maxn];
int rq, cq;
int mosaic[maxn][maxn];

int hs[maxn];
int inv[maxn];

int32_t main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout); 
    #endif
    ios::sync_with_stdio(0);cin.tie(0);

    cin>> rp>> cp;
    for(int i=1; i<=rp; i++)
    {
        for(int j=1; j<=cp; j++)
        {
            cin>> motif[i][j];
        }
    }
    cin>> rq>> cq;
    for(int i=1; i<=rq; i++)
    {
        for(int j=1; j<=cq; j++)
        {
            cin>> mosaic[i][j];
        }
    }
    for(int i=1; i<=100; i++)
    {
        hs[i] = rand(1, md-1);
        inv[i] = modInv(hs[i], md);
    }
    vector<int> a;
    for(int i=1; i<=rq; i++)
    {
        for(int j=1; j<=cq; j++)
        {
            a.pb(hs[mosaic[i][j]]);
        }
        for(int j=1; j<=cq; j++)
        {
            a.pb(rand(1, md-1));
        }
    }
    vector<int> b;
    int naonulos = 0;
    for(int i=1; i<=rp; i++)
    {
        for(int j=1; j<=cp; j++)
        {
            if(motif[i][j] == 0)
            {
                b.pb(0);
            }
            else
            {
                naonulos++;
                b.pb(inv[motif[i][j]]);
            }
        }
        for(int j=1; j<=2*cq - cp; j++)
            b.pb(0);
    }
    int tp = rp * cp;
    int tq = rq * cq;
    int szb = b.size();
    reverse(b.begin(), b.end());
    auto c = convMod(a, b);
    vector<pii> ans;
    for(int i=1; i+rp-1<=rq; i++)
    {
        for(int j=1; j+cp-1<=cq; j++)
        {
            int id = (i-1) * (2 * cq) + (j-1);
            int cara = c[szb - 1 + id];
            if(cara == naonulos)
            {
                ans.eb(i, j);
            }
        }
    }
    cout<< ans.size()<< "\n";
    for(auto [i, j]: ans)
    {
        cout<< i<< " "<< j<< "\n";
    }

    return 0;
}