#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int rd() {
  char s[3];
  scanf("%s", s);
  int x = 0;
  for (int i = 0; i < 2; ++i) {
    (x *= 16) += (isdigit(s[i]) ? (0 + (s[i] - '0')) : (10 + (s[i] - 'A')));
  }
  return x;
}
void wt(int x) {
  const int as[2] = {x / 16, x % 16};
  for (int i = 0; i < 2; ++i) {
    putchar((as[i] < 10) ? ('0' + (as[i] - 0)) : ('A' + (as[i] - 10)));
  }
}


constexpr int K = 10;

int main() {
  char typ[110];
  for (; ~scanf("%s", typ); ) {
    if (!strcmp(typ, "message")) {
      int M, N;
      scanf("%d%d", &M, &N);
      vector<vector<int>> A(M, vector<int>(N));
      for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
        A[x][y] = rd();
      }
      
      vector<int> B;
      B.push_back(M / 256);
      B.push_back(M % 256);
      B.push_back(N / 256);
      B.push_back(N % 256);
      for (int x = 0; x < M; x += K) {
        B.insert(B.end(), A[x].begin(), A[x].end());
      }
      
      const int BLen = B.size();
      printf("%d\n", BLen);
      for (int i = 0; i < BLen; ++i) {
        if (i) printf(" ");
        wt(B[i]);
      }
      puts("");
    } else if (!strcmp(typ, "parts")) {
      int BLen;
      scanf("%d", &BLen);
      vector<int> B(BLen);
      for (int i = 0; i < BLen; ++i) {
        B[i] = rd();
      }
      
      const int M = B[0] * 256 + B[1];
      const int N = B[2] * 256 + B[3];
      
      int Q;
      scanf("%d", &Q);
      for (; Q--; ) {
        int H, W;
        scanf("%d%d", &H, &W);
        vector<vector<int>> C(H, vector<int>(W));
        for (int dx = 0; dx < H; ++dx) for (int dy = 0; dy < W; ++dy) {
          C[dx][dy] = rd();
        }
        
        for (int dx = 0; dx < H; ++dx) {
          vector<int> fail(W + 1);
          {
            int j = fail[0] = -1;
            for (int dy = 0; dy < W; ++dy) {
              for (; ~j && C[dx][j] != C[dx][dy]; j = fail[j]) {}
              fail[dy + 1] = ++j;
            }
          }
          for (int x = 0, i0 = 4; x < M; x += K, i0 += N) {
            int j = 0;
            for (int y = 0; y < N; ++y) {
              for (; ~j && C[dx][j] != B[i0 + y]; j = fail[j]);
              if (++j == W) {
                printf("%d %d\n", x - dx + 1, (y - (W - 1)) + 1);
                goto found;
              }
            }
          }
        }
        assert(false);
       found:{}
      }
    } else {
      assert(false);
    }
  }
  return 0;
}