#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using LL = long long;

int r, c;
string s;
int a[2005][2005];
vector<int> ans;
int h[2005][2005];
pair<int, int> p[2005][2005];
int qa[55][55];
unordered_map<LL, pair<int, int>> M;

int sw(char c) {
	if (c >= '0' && c <= '9') {
		return c - '0';
	}
	return c - 'A' + 10;
}

int tonum(string s) {
	int a0 = sw(s[0]);
	int a1 = sw(s[1]);
	return a0 * 16 + a1;

}

string st(int x) {
	string s;
	if (x > 9) s += (x - 10 + 'A');
	else s += (x + '0');
	return s;
}

string tostring(int num) {
	int a0 = num / 16;
	int a1 = num % 16;
	return st(a0) + st(a1);
}

void encode() {
	//cout << tostring(255) << endl;
	cin >> r >> c;
	ans.push_back(r / 256);
	ans.push_back(r % 256);
	ans.push_back(c / 256);
	ans.push_back(c % 256);
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			cin >> s;
			int num = tonum(s);
			a[i][j] = num;
		}
	}
	int ilen = 3;
	for (int i = 1; i + ilen - 1 <= r; ) {
		int jlen = 3;
		for (int j = 1; j + jlen - 1 <= c; ) {
			int x = 0;
			x = a[i][j];
			ans.push_back(x);
			
			j += jlen;
			jlen = 7 - jlen;
		}
		i += ilen;
		ilen = 7 - ilen;
	}
	cout << (int)ans.size() << "\n";
	for (int i = 0; i < ans.size(); i++) {
		cout << tostring(ans[i]);
		cout << " \n"[i == ans.size() - 1];
	}
}

void decode() {
	int n;
	cin >> n;
	string s1, s2, s3, s4;
	cin >> s1 >> s2 >> s3 >> s4;
	int a1 = tonum(s1), a2 = tonum(s2), a3 = tonum(s3), a4 = tonum(s4);
	r = a1 * 256 + a2;
	c = a3 * 256 + a4;
	//cout << "r and c : " << r << " " << c << endl;
	int i = 1, j = 1, ilen = 3, jlen = 3;
	int hi = 1, hj = 1;
	for (int t = 5; t <= n; t++) {
		string s;
		cin >> s;
		if (j + jlen - 1 > c) {
			i += ilen;
			j = 1;
			hi++;
			hj = 1;
			ilen = 7 - ilen;
			jlen = 3;
		}
		h[hi][hj] = tonum(s);
		p[hi][hj] = {i, j};
		hj++;
		j += jlen;
		jlen = 7 - jlen;
	}

	
	for (int i = 1; i <= hi; i++) {
		for (int j = 1; j <= hj; j++) {
			ll num = h[i][j];
			// cout << p[i][j].first << " " << p[i][j].second << " " << tostring(num) << " ";
			num = num * 256 + h[i][j + 1];
			num = num * 256 + h[i + 1][j];
			num = num * 256 + h[i + 1][j + 1];
			M[num] = p[i][j];
		}
		// cout << endl;
	}

	int q;
	cin >> q;

	for (int qi = 1; qi <= q; qi++) {
		int qr, qc;
		cin >> qr >> qc;
		for (int i = 1; i <= qr; i++) {
			for (int j = 1; j <= qc; j++) {
				string tmp;
				cin >> tmp;
				int num = tonum(tmp);
				qa[i][j] = num;
			}
		}

		vector<pii> cands;

		auto test = [&](int x, int y) {
			for (int i = 1; i <= qr - x; i++) {
				for (int j = 1; j <= qc - y; j++) {
					ll num = qa[i][j];
					num = num * 256 + qa[i][j + y];
					num = num * 256 + qa[i + x][j];
					num = num * 256 + qa[i + x][j + y];

					if (M.count(num)) {
						auto [mx, my] = M[num];
						cands.push_back({mx - i + 1, my - j + 1});
					}
				}
			}
		};
		test(3, 3);
		test(3, 4);
		test(4, 3);
		test(4, 4);

		sort(cands.begin(), cands.end());

		if (cands.empty()) {
			cout << -1 << " " << -1 << "\n";
		}
		else if (cands.front() != cands.back()) {
			cout << -2 << " " << -2 << "\n";
		}
		else {
			cout << cands.front().first << " " << cands.front().second << "\n";
		}
	}

}
 
int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);
	string s;
	cin >> s;
	if (s[0] == 'm') {
		encode();
	}
	else {
		decode();
	}
	
}