#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)::size(x)
#define all(x) ::begin(x), ::end(x)
#define debug(x) cerr << "[" << __LINE__ << "] "#x" = " << (x) << endl

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int r, c;
    cin >> r >> c;
    int a[r][c];
    for (int i=0; i<r; i++) {
        for (int j=0; j<c; j++) cin >> a[i][j];
    }

    int n, m;
    cin >> n >> m;
    int b[n][m];
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) cin >> b[i][j];
    }

    constexpr int MX = 1000 * 1000;
    vector<bitset<MX>> bs(101);
    for (int k=1; k<101; k++) {
        for (int i=0; i<n; i++) {
            for (int j=0; j<m; j++) {
                bs[k][i*m + j] = b[i][j] == k;
            }
        }
    }

    bitset<MX> ans;
    for (int i=0; i<n*m; i++) ans[i] = 1;

    for (int i=0; i<r; i++) {
        for (int j=0; j<c; j++) {
            if (a[i][j] == 0) continue;
            auto& duh = bs[a[i][j]];
            ans &= duh >> (i * m + j);
        }
    }

    vector<pair<int, int>> ans2;
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            if (ans[i * m + j]) ans2.emplace_back(i, j);
        }
    }

    cout << sz(ans2) << '\n';
    sort(all(ans2));
    for (auto [x, y] : ans2) cout << x+1 << ' ' << y+1 << '\n';
}