#include <bits/stdc++.h>
using namespace std;


void message() {
    int r, c;
    scanf("%d%d", &r, &c);
    vector<vector<int> > s(r, vector<int>(c));
    for(int i = 0; i < r; i ++)
        for(int j = 0; j < c; j ++)
            scanf("%X", &s[i][j]);
    vector<int> msg;
    msg.push_back(r / 256);
    msg.push_back(r % 256);
    msg.push_back(c / 256);
    msg.push_back(c % 256);
    int tmp = 0, cnt = 0;
    for(int i = 0; i < r; i ++)
        for(int j = i % 2; j < c; j += 2) {
            tmp = tmp * 2 + (s[i][j] % 2);
            cnt ++;
            if(cnt == 8) {
                cnt = 0;
                msg.push_back(tmp);
                tmp = 0;
            }
        }
    if(cnt) {
        while(cnt < 8) {
            tmp *= 2;
            cnt ++;
        }
        msg.push_back(tmp);
    }
    printf("%u\n", msg.size());
    for(int x : msg) printf("%02X ", x);
}

bool check(const vector<vector<int> > &a, vector<vector<int> > &b, int x, int y) {
    for(int i = 0; i < b.size(); i ++)
        for(int j = (x + y + i) % 2; j < b[i].size(); j += 2)
            if(b[i][j] != a[i + x][j + y])
                return false;
    return true;
}

bool check(const vector<vector<vector<int> > > &a, const vector<int> &b, int x, int y, int l) {
    for(int i = 0; i < b.size(); i ++)
            if(a[x + i][y][l] != b[i])
                return false;
    return true;
}

void parts() {
    int m;
    scanf("%d", &m);
    vector<int> v(m);
    for(int i = 0; i < m; i ++)
        scanf("%X", &v[i]);
    
    int r = v[0] * 256 + v[1], c = v[2] * 256 + v[3];
    vector<vector<int> > s(r, vector<int>(c));
    for(int i = 0, p = 4, l = 7; i < r; i ++)
        for(int j = i % 2; j < c; j += 2) {
            s[i][j] = (v[p] >> l) & 1;
            l --;
            if(l < 0) {
                p ++;
                l = 7;
            }
        }

    vector<vector<vector<int> > > hashS(r, vector<vector<int> >(c, vector<int>(20)));
    map<pair<int, int>, vector<pair<int, int> > > pos; 

    for(int i = 0; i < r; i ++)
        for(int j = 0; j < c; j ++) {
            hashS[i][j][0] = s[i][j];
            pos[{0, hashS[i][j][0]}].emplace_back(i, j);
            for(int k = 1; k < 20 && j + k < c; k ++) {
                hashS[i][j][k] = hashS[i][j][k - 1] * 2 + s[i][j + k];
                pos[{k, hashS[i][j][k]}].emplace_back(i, j);
            }
        }

    
    
    int q;
    scanf("%d", &q);
    for(int _ = 0, tr, tc; _ < q; _ ++) {
        cin >> tr >> tc;
        vector<vector<int> > a(tr, vector<int>(tc)), b(tr, vector<int>(tc));
        for(int i = 0; i < tr; i ++)
            for(int j = 0, x; j < tc; j ++) {
                scanf("%X", &x);
                ((i + j) % 2 ? a : b)[i][j] = x % 2;
            }
        vector<int> hashA(tr), hashB(tr);
        for(int i = 0; i < tr; i ++)
            for(int j = 0; j < tc; j ++) {
                hashA[i] = hashA[i] * 2 + a[i][j];
                hashB[i] = hashB[i] * 2 + b[i][j];
            }
        
        bool found = false;
        for(auto &[i, j] : pos[{tc - 1, hashA.front()}])
            if(check(hashS, (i + j) % 2 ? hashA : hashB, i, j, tc - 1)) {
                cout << i + 1 << " " << j + 1 << "\n";
                found = true;
                break;
            }
        if(found) continue;
        for(auto &[i, j] : pos[{tc - 1, hashB.front()}])
            if(check(hashS, (i + j) % 2 ? hashA : hashB, i, j, tc - 1)) {
                cout << i + 1 << " " << j + 1 << "\n";
                found = true;
                break;
            }
    }

}

int main() {
    string op;
    cin >> op;

    if(op == "message") message();
    else parts();
}