#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int cti(char c) {
    if (isdigit(c)) return c-'0';
    else return c-'A'+10;
}

char itc(int i) {
    if (i <= 9) return (char)('0'+i);
    else return (char)('A'+i-10);
}

int sti(string s) {
    return cti(s[0])*16 + cti(s[1]);
}

string its(int i) {
    string res;
    res += itc(i/16);
    res += itc(i%16);
    return res;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string str; cin >> str;
    if (str == "message") {
        int h,w; cin >> h >> w;
        vector<vector<int>> a(h, vector<int>(w));
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < w; ++j) {
                string s; cin >> s;
                a[i][j] = sti(s);
            }
        }
        vector<string> res;
        res.push_back(its(h/256));
        res.push_back(its(h%256));
        res.push_back(its(w/256));
        res.push_back(its(w%256));
        for (int i = 0; i < h; i += 3) {
            for (int j = 0; j < w; j += 3) {
                res.push_back(its(a[i][j]));
            }
        }
        cout << res.size() << "\n";
        for (int i = 0; i < res.size(); ++i) {
            if (i) cout << " ";
            cout << res[i];
        }
        cout << "\n";
    }
    else {
        int n; cin >> n;
        string s1,s2; cin >> s1 >> s2;
        int h = sti(s1)*256 + sti(s2);
        cin >> s1 >> s2;
        int w = sti(s1)*256 + sti(s2);

        vector<vector<int>> x(h, vector<int>(w));
        for (int i = 0; i < h; i += 3) {
            for (int j = 0; j < w; j += 3) {
                string s; cin >> s;
                x[i][j] = sti(s);
            }
        }

        map<vector<int>, vector<pair<int,int>>> mp;
        for (int i = 0; i+6 < h; i += 3) {
            for (int j = 0; j+6 < w; j += 3) {
                vector<int> v;
                for (int k = 0; k < 3; ++k) {
                    for (int l = 0; l < 3; ++l) {
                        v.push_back(x[i+k*3][j+l*3]);
                    }
                }
                mp[v].push_back({i,j});
            }
        }

        int q; cin >> q;
        auto slv = [&](int a, int b, vector<vector<int>> &v) -> pair<int,int> {
            vector<pair<int,int>> kouho;
            for (int i = 0; i+6 < a; ++i) {
                for (int j = 0; j+6 < b; ++j) {
                    vector<int> vv;
                    for (int k = 0; k < 3; ++k) {
                        for (int l = 0; l < 3; ++l) {
                            vv.push_back(v[i+k*3][j+l*3]);
                        }
                    }
                    if (mp.find(vv) != mp.end()) {
                        auto r = mp[vv];
                        for (int k = 0; k < r.size(); ++k) {
                            kouho.push_back({r[k].first-i, r[k].second-j});
                        }
                    }
                }
            }
            sort(kouho.begin(), kouho.end());
            kouho.erase(unique(kouho.begin(), kouho.end()), kouho.end());
            if (kouho.size()) {
                return {kouho[0].first, kouho[0].second};
            }
            return {-1, -1};
        };
        while (q--) {
            int a,b; cin >> a >> b;
            vector<vector<int>> v(a, vector<int>(b));
            for (int i = 0; i < a; ++i) {
                for (int j = 0; j < b; ++j) {
                    string s; cin >> s;
                    v[i][j] = sti(s);
                }
            }
            auto res = slv(a,b,v);
            cout << res.first+1 << " " << res.second+1 << "\n";
        }
    }
}