#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

namespace hash_impl {

static constexpr unsigned long long mod = (1ULL << 61) - 1;

struct modint {
    modint() : _v(0) {}
    modint(unsigned long long v) {
        v = (v >> 61) + (v & mod);
        if (v >= mod) v -= mod;
        _v = v;
    }

    unsigned long long val() const { return _v; }

    modint& operator+=(const modint& rhs) {
        _v += rhs._v;
        if (_v >= mod) _v -= mod;
        return *this;
    }
    modint& operator-=(const modint& rhs) {
        if (_v < rhs._v) _v += mod;
        _v -= rhs._v;
        return *this;
    }
    modint& operator*=(const modint& rhs) {
        __uint128_t t = __uint128_t(_v) * rhs._v;
        t = (t >> 61) + (t & mod);
        if (t >= mod) t -= mod;
        _v = t;
        return *this;
    }
    modint& operator/=(const modint& rhs) { return *this = *this * rhs.inv(); }

    modint operator-() const { return modint() - *this; }

    modint pow(long long n) const {
        assert(0 <= n);
        modint x = *this, r = 1;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    modint inv() const { return pow(mod - 2); }

    friend modint operator+(const modint& lhs, const modint& rhs) { return modint(lhs) += rhs; }
    friend modint operator-(const modint& lhs, const modint& rhs) { return modint(lhs) -= rhs; }
    friend modint operator*(const modint& lhs, const modint& rhs) { return modint(lhs) *= rhs; }
    friend modint operator/(const modint& lhs, const modint& rhs) { return modint(lhs) /= rhs; }
    friend bool operator==(const modint& lhs, const modint& rhs) { return lhs._v == rhs._v; }
    friend bool operator!=(const modint& lhs, const modint& rhs) { return lhs._v != rhs._v; }
    friend std::ostream& operator<<(std::ostream& os, const modint& rhs) { os << rhs._v; }

  private:
    unsigned long long _v;
};

uint64_t generate_base() {
    std::mt19937_64 mt(std::chrono::steady_clock::now().time_since_epoch().count());
    std::uniform_int_distribution<uint64_t> rand(2, mod - 1);
    return rand(mt);
}

modint base(generate_base());
std::vector<modint> power{1};

modint get_pow(int n) {
    if (n < int(power.size())) return power[n];
    int m = power.size();
    power.resize(n + 1);
    for (int i = m; i <= n; i++) power[i] = power[i - 1] * base;
    return power[n];
}

};  // namespace hash_impl

struct Hash {
    using mint = hash_impl::modint;
    mint x;
    int len;

    Hash() : x(0), len(0) {}
    Hash(mint x, int len) : x(x), len(len) {}

    Hash& operator+=(const Hash& rhs) {
        x = x * hash_impl::get_pow(rhs.len) + rhs.x;
        len += rhs.len;
        return *this;
    }
    Hash operator+(const Hash& rhs) { return *this += rhs; }
    bool operator==(const Hash& rhs) { return x == rhs.x and len == rhs.len; }
};

struct ReversibleHash {
    using mint = hash_impl::modint;
    mint x, rx;
    int len;

    ReversibleHash() : x(0), rx(0), len(0) {}
    ReversibleHash(mint x) : x(x), rx(x), len(1) {}
    ReversibleHash(mint x, mint rx, int len) : x(x), rx(rx), len(len) {}

    ReversibleHash rev() const { return ReversibleHash(rx, x, len); }

    ReversibleHash operator+=(const ReversibleHash& rhs) {
        x = x * hash_impl::get_pow(rhs.len) + rhs.x;
        rx = rx + rhs.rx * hash_impl::get_pow(len);
        len += rhs.len;
        return *this;
    }
    ReversibleHash operator+(const ReversibleHash& rhs) { return *this += rhs; }
    bool operator==(const ReversibleHash& rhs) { return x == rhs.x and rx == rhs.rx and len == rhs.len; }
};

struct RollingHash2D {
    using mint = hash_impl::modint;

    static inline uint64_t generate_base() {
        std::mt19937_64 mt(std::chrono::steady_clock::now().time_since_epoch().count());
        std::uniform_int_distribution<uint64_t> rand(2, hash_impl::mod - 1);
        return rand(mt);
    }

    RollingHash2D(uint64_t base0 = generate_base(), uint64_t base1 = generate_base()) {
        basis[0] = base0;
        basis[1] = base1;
        power[0].assign(1, 1);
        power[1].assign(1, 1);
    }

    template <typename T> std::vector<std::vector<mint>> build(const T& s) const {
        int n = s.size(), m = s[0].size();
        std::vector<std::vector<mint>> hash(n + 1, std::vector<mint>(m + 1, 0));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                hash[i + 1][j + 1] =
                    hash[i][j + 1] * basis[0] + hash[i + 1][j] * basis[1] - hash[i][j] * basis[0] * basis[1] + s[i][j];
            }
        }
        return hash;
    }

    template <typename T> mint get(const T& s) const {
        mint res = 0;
        for (int i = 0; i < int(s.size()); i++) {
            mint sum = 0;
            for (const auto& x : s[i]) sum = sum * basis[1] + x;
            res = res * basis[0] + sum;
        }
        return res;
    }

    mint query(const std::vector<std::vector<mint>>& hash, int xl, int xr, int yl, int yr) {
        assert(0 <= xl and xl <= xr and 0 <= yl and yl <= yr);
        extend(0, xr - xl);
        extend(1, yr - yl);
        return hash[xr][yr] - hash[xl][yr] * power[0][xr - xl] - hash[xr][yl] * power[1][yr - yl] +
               hash[xl][yl] * power[0][xr - xl] * power[1][yr - yl];
    }

  private:
    mint basis[2];
    std::vector<mint> power[2];

    inline void extend(int x, int len) {
        if (int(power[x].size()) > len) return;
        int pre = power[x].size();
        power[x].resize(len + 1);
        for (int i = pre - 1; i < len; i++) power[x][i + 1] = power[x][i] * basis[x];
    }
};

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const int MAX = 16, ROW = 3, COL = 4;

int ctoi(char c) { return isdigit(c) ? c - '0' : 10 + c - 'A'; }

char itoc(int n) { return n < 10 ? '0' + n : 'A' + (n - 10); }

int htoi(const string& s) { return ctoi(s[0]) * MAX + ctoi(s[1]); }

string itoh(int n) {
    string res = "";
    return res + itoc(n / MAX) + itoc(n % MAX);
}

void solve1() {
    int r, c;
    cin >> r >> c;
    vector S(r, vector<string>(c));
    cin >> S;

    vector<string> ans;
    ans.emplace_back(itoh(r / (MAX * MAX)));
    ans.emplace_back(itoh(r % (MAX * MAX)));
    ans.emplace_back(itoh(c / (MAX * MAX)));
    ans.emplace_back(itoh(c % (MAX * MAX)));
    for (int i = 0; i < r; i += ROW) {
        for (int j = 0; j < c; j += COL) {
            ans.emplace_back(S[i][j]);
        }
    }
    cout << ans.size() << '\n';
    cout << ans << '\n';
}

void solve2() {
    int m;
    cin >> m;
    vector<string> S(m);
    cin >> S;

    int r = htoi(S[0]) * (MAX * MAX) + htoi(S[1]);
    int c = htoi(S[2]) * (MAX * MAX) + htoi(S[3]);
    vector<vector<int>> mass;
    for (int i = 0, cur = 4; i < r; i += ROW) {
        vector<int> tmp;
        for (int j = 0; j < c; j += COL) {
            tmp.emplace_back(htoi(S[cur++]));
        }
        mass.emplace_back(tmp);
    }
    RollingHash2D RH;
    auto hashes = RH.build(mass);
    map<pair<int, int>, map<uint64_t, pair<int, int>>> mp;
    auto calc = [&](int x, int y) {
        map<uint64_t, pair<int, int>> res;
        for (int i = 0; i + x <= int(mass.size()); i++) {
            for (int j = 0; j + y <= int(mass[0].size()); j++) {
                res[RH.query(hashes, i, i + x, j, j + y).val()] = {i * ROW, j * COL};
            }
        }
        mp[{x, y}] = res;
    };
    auto check = [&](int x, int y, uint64_t val) -> pair<int, int> {
        if (not mp.count({x, y})) calc(x, y);
        return mp[{x, y}].count(val) ? mp[{x, y}][val] : make_pair(-1, -1);
    };
    int q;
    cin >> q;
    for (; q--;) {
        int h, w;
        cin >> h >> w;
        vector target(h, vector<int>(w));
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                string tmp;
                cin >> tmp;
                target[i][j] = htoi(tmp);
            }
        }
        int ansx = -1, ansy = -1;
        for (int i = 0; i < ROW; i++) {
            for (int j = 0; j < COL; j++) {
                int cr = 0, cc = 0;
                for (int k = i; k < h; k += ROW) cr++;
                for (int k = j; k < w; k += COL) cc++;
                vector<vector<int>> base;
                for (int k = i; k < h; k += ROW) {
                    vector<int> tmp;
                    for (int l = j; l < w; l += COL) {
                        tmp.emplace_back(target[k][l]);
                    }
                    base.emplace_back(tmp);
                }
                auto res = check(cr, cc, RH.get(base).val());
                if (res.first != -1) ansx = res.first - i, ansy = res.second - j;
            }
        }
        cout << ansx + 1 << ' ' << ansy + 1 << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string op;
    cin >> op;
    if (op == "message")
        solve1();
    else
        solve2();
    return 0;
}