#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)
#define all(x) begin(x), end(x)
template <typename T>
bool chmax(T& a, const T& b) {
    return a < b ? (a = b, 1) : 0;
}
template <typename T>
bool chmin(T& a, const T& b) {
    return a > b ? (a = b, 1) : 0;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    auto decode = [&](string s) {
        int n = 0;
        for (char c : s) {
            n *= 16;
            if ('0' <= c && c <= '9')
                n += c - '0';
            else
                n += 10 + (c - 'A');
        }
        return n;
    };

    auto encode = [&](int n) {
        string s = "";
        rep(_, 0, 2) {
            int r = n % 16;

            if (r < 10)
                s += '0' + r;
            else
                s += 'A' + (r - 10);

            n /= 16;
        }
        reverse(all(s));
        return s;
    };

    string op;
    cin >> op;
    if (op == "message") {
        int r, c;
        cin >> r >> c;
        vector<vector<int>> mat(r, vector<int>(c));
        rep(i, 0, r) rep(j, 0, c) {
            string s;
            cin >> s;
            mat[i][j] = decode(s);
        }

        vector<int> message;
        message.push_back(r / 256);
        message.push_back(r % 256);
        message.push_back(c / 256);
        message.push_back(c % 256);
        for (int i = 0; i < r; i += 3) {
            for (int j = 0; j < c; j += 3) {
                message.push_back(mat[i][j]);
            }
        }
        cout << message.size() << endl;
        rep(i, 0, message.size()) {
            cout << encode(message[i])
                 << (i < (int)message.size() - 1 ? " " : "\n");
        }
    } else {
        int m;
        cin >> m;
        vector<int> message(m);
        rep(i, 0, m) {
            string s;
            cin >> s;
            message[i] = decode(s);
        }
        int r = (message[0] * 256 + message[1] + 2) / 3;
        int c = (message[2] * 256 + message[3] + 2) / 3;
        assert(message.size() == 4 + r * c);
        vector<vector<int>> mat(r, vector<int>(c));
        int k = 4;
        rep(i, 0, r) rep(j, 0, c) mat[i][j] = message[k++];
        map<vector<vector<int>>, pair<int, int>> mp;
        rep(i, 0, r - 2) rep(j, 0, c - 2) {
            vector<vector<int>> small(3, vector<int>(3));
            rep(k, 0, 3) rep(l, 0, 3) { small[k][l] = mat[i + k][j + l]; }
            mp[small] = {i, j};
        }

        int q;
        cin >> q;
        while (q--) {
            int h, w;
            cin >> h >> w;
            vector<vector<int>> query(h, vector<int>(w));
            rep(i, 0, h) rep(j, 0, w) {
                string s;
                cin >> s;
                query[i][j] = decode(s);
            }
            bool ok = false;
            rep(k, 0, 3) {
                rep(l, 0, 3) {
                    vector<vector<int>> small(3, vector<int>(3));
                    rep(i, 0, 3) rep(j, 0, 3) {
                        small[i][j] = query[k + 3 * i][l + 3 * j];
                    }
                    if (mp.count(small)) {
                        auto [r, c] = mp[small];
                        r = 3 * r - k + 1;
                        c = 3 * c - l + 1;
                        cout << r << " " << c << endl;
                        ok = true;
                        break;
                    }
                }
                if (ok) break;
            }
            assert(ok);
        }
    }
}