#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%ll"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
// BOR
#define alp 26
#define HOW 1000100
#define NONE -1000000
struct node{
  int next[alp] , go[alp];
  int par , link;
  char pch;
  int word , up;
};
node T[HOW]; int SZ;
void clear(int w){
  memset(T[w].next , -1 , sizeof T[w].next);
  memset(T[w].go , -1 , sizeof T[w].go);
  T[w].par = T[w].link = -1; T[w].pch = 0;
  T[w].word = NONE; T[w].up = NONE;
}
void init(){ // pered izpolzovaniem vuzuvaj
  clear(0); SZ=1;
}
void add(char* w , int id){ // Portit w
  int L = strlen(w) , pos=0;
  for(int i=0;i<L;++i){
   w[i] -= 'A';
   if(T[pos].next[w[i]] == -1){
    T[pos].next[w[i]] = SZ;
    clear(SZ);
    T[SZ].par = pos; T[SZ++].pch = w[i];
                              }
   pos = T[pos].next[w[i]];
                      }
  T[pos].word = id;
}
int go(int vr,char w);
int get_link(int vr){
  if(T[vr].link == -1){
   if(vr==0 || T[vr].par==0)T[vr].link=0;
   else T[vr].link = go( get_link(T[vr].par) , T[vr].pch );
                      }
  return T[vr].link;
}
int go(int vr , char w){
  if(T[vr].go[w] == -1){
   if(T[vr].next[w]!=-1)T[vr].go[w]=T[vr].next[w];
   else if(vr==0)T[vr].go[w] = 0;
        else T[vr].go[w] = go(get_link(vr) , w);
                       }
  return T[vr].go[w];
}
int get_word(int vr){
  if(T[vr].up != NONE)
   return T[vr].up;
  if(vr == 0)
   return T[vr].up = -1;
  int par = get_link(vr);
  if(T[par].word != NONE)
   T[vr].up = par;
  else
   T[vr].up = get_word(par);
}
vi words(int vr){
  vi ret;
  while(vr >= 0){
   if(T[vr].word != NONE)
    ret.pb(T[vr].word);
   vr = get_word(vr);
                }
  return ret;
}
// Solution
#define MID 1005
int R , C , W;
char in[1010][1010];
char wrds[1010][1010];
int _WL[1010];
map< string , pair<pii , int> > ans;
int hor[1010] , ver[1010] , ipj[2010] , imj[2100];
void relax(const vi& on , pair<pii , char> data){
  for(int i=0;i<sz(on);++i)
   ans[string(wrds[on[i]])] = data;
}
int main(){
  freopen("crossword.in" , "r" , stdin);
  freopen("crossword.out" , "w" , stdout);
  init();
  scanf("%d%d%d" , &R , &C , &W);
  for(int i=0;i<R;++i)
   scanf("%s" , &in[i]);
  for(int i=0;i<W;++i){
   scanf("%s" , &wrds[i]);
   _WL[i] = strlen(wrds[i]);
   add(wrds[i] , i);
   for(int j=0;j<_WL[i];++j)
    wrds[i][j] += 'A';
                      }
  memset(hor , 0 , sizeof hor);
  memset(ver , 0 , sizeof ver);
  memset(ipj , 0 , sizeof ipj);
  memset(imj , 0 , sizeof imj);
  for(int i=0;i<R;++i)
   for(int j=0;j<C;++j){
    int I = i , J = j,
        IPJ = i + j , IMJ = i - j + MID;
    hor[I] = go(hor[I] , in[i][j] - 'A');
    relax(words(hor[I]) , mp(mp(i , j) , 'C'));
    ver[J] = go(ver[J] , in[i][j] - 'A');
    relax(words(ver[J]) , mp(mp(i , j) , 'E'));
    ipj[IPJ] = go(ipj[IPJ] , in[i][j] - 'A');
    relax(words(ipj[IPJ]) , mp(mp(i , j) , 'F'));
    imj[IMJ] = go(imj[IMJ] , in[i][j] - 'A');
    relax(words(imj[IMJ]) , mp(mp(i , j) , 'D'));
                       }
  memset(hor , 0 , sizeof hor);
  memset(ver , 0 , sizeof ver);
  memset(ipj , 0 , sizeof ipj);
  memset(imj , 0 , sizeof imj);
  for(int i=R-1;i>=0;--i)
   for(int j=C-1;j>=0;--j){
    int I = i , J = j,
        IPJ = i + j , IMJ = i - j + MID;
    hor[I] = go(hor[I] , in[i][j] - 'A');
    relax(words(hor[I]) , mp(mp(i , j) , 'G'));
    ver[J] = go(ver[J] , in[i][j] - 'A');
    relax(words(ver[J]) , mp(mp(i , j) , 'A'));
    ipj[IPJ] = go(ipj[IPJ] , in[i][j] - 'A');
    relax(words(ipj[IPJ]) , mp(mp(i , j) , 'B'));
    imj[IMJ] = go(imj[IMJ] , in[i][j] - 'A');
    relax(words(imj[IMJ]) , mp(mp(i , j) , 'H'));
                       }
  for(int i=0;i<W;++i){
   int WL = _WL[i] - 1;
   //cout<<wrds[i]<<endl;
   pair<pii , char> out = ans[string(wrds[i])];
   //cout<<out.fi.fi<<' '<<out.fi.se<<":"<<WL<<endl;
   switch(out.se){
    case 'A':
      printf("%d %d A\n" , out.fi.fi + WL , out.fi.se);
      break;
    case 'B':
      printf("%d %d B\n" , out.fi.fi + WL , out.fi.se - WL);
      break;
    case 'C':
      printf("%d %d C\n" , out.fi.fi , out.fi.se - WL);
      break;
    case 'D':
      printf("%d %d D\n" , out.fi.fi - WL , out.fi.se - WL);
      break;
    case 'E':
      printf("%d %d E\n" , out.fi.fi - WL , out.fi.se);
      break;
    case 'F':
      printf("%d %d F\n" , out.fi.fi - WL , out.fi.se + WL);
      break;
    case 'G':
      printf("%d %d G\n" , out.fi.fi , out.fi.se + WL);
      break;
    case 'H':
      printf("%d %d H\n" , out.fi.fi + WL , out.fi.se + WL);
      break;
                 }
                      }
  return 0;
}