#include<bits/stdc++.h>
namespace First {
   inline char to16(int x) {
      return x < 10 ? (x + '0') : (x - 10 + 'A');
   }
   inline std::string to256(int x) {
      return std::string("") + to16(x / 16) + to16(x % 16);
   }
   inline void main() {
      int n, m;
      std::cin >> n >> m;
      std::vector<std::string> ans;
      ans.push_back(to256(m / 256)), ans.push_back(to256(m % 256));
      for (int i = 0; i < n; i++)
         for (int j = 1; j <= m; j++) {
            std::string s;
            std::cin >> s;
            if (i % 10 == 0) ans.push_back(s);
         }
      std::cout << ans.size() << '\n';
      for (auto x : ans) std::cout << x << ' ';
   }
}
namespace Second {
   inline int to16(char x) {
      return x >= 'A' ? (x - 'A' + 10) : (x - '0');
   }
   inline int to256(std::string x) {
      return to16(x[0]) * 16 + to16(x[1]);
   }
   const int maxn = 2000 * 200 * 10 + 10;
   std::unordered_map<int, int> son[maxn];
   inline void main() {
      int len; std::cin >> len;
      std::vector<std::string> S(len);
      for (auto &x : S) std::cin >> x;
      int m = to256(S[0]) * 256 + to256(S[1]);
      int tot = 0;
      for (int i = 2, h = 1; i < S.size(); i += m, h += 10) {
         for (int j = i; j + 10 <= i + m; j++) {
            int now = 0;
            for (int k = j; k < j + 10; k++) {
               if (! son[now][to256(S[k])]) son[now][to256(S[k])] = ++tot;
               now = son[now][to256(S[k])];
            }
            son[now][0] = h, son[now][1] = j - i + 1;
         }
      }
      int Q; std::cin >> Q;
      while (Q--) {
         int h, w; std::cin >> h >> w;
         std::vector<std::string> T(w);
         int ansx = -1, ansy = -1;
         for (int i = 0; i < h; i++) {
            for (auto &x : T) std::cin >> x;
            if (ansx == -1) {
               int now = 0;
               for (int j = 0; j < 10; j++) {
                  if (! son[now].count(to256(T[j]))) {now = 0; break;}
                  else now = son[now][to256(T[j])];
               }
               if (now) ansx = son[now][0] - i, ansy = son[now][1];
            }
         }
         std::cout << ansx << ' ' << ansy << '\n';
      }
   }
}
int main() {
   std::ios::sync_with_stdio(false);
   std::cin.tie(0), std::cout.tie(0);
   std::string s; std::cin >> s;
   s == "message" ? First::main() : Second::main();
   return 0;
}