#include <cstdio>

#define MAXN 1000
#define MAXM 1000
#define MAXW 1000

#define NONE -1


struct Node
{
	int wordIdx;
	Node *children[26];
	
	Node();
} nodes[MAXW*MAXN];
int nodeN=0;
Node *root;

Node :: Node () { wordIdx=NONE; for(int i=0; i<26; i++) children[i]=NULL; }

Node *newNode () { return &nodes[nodeN++]; }

void addWord(Node *cur, char *str, int wIdx)
{
	for(int i=0; str[i]!='\0'; i++)
	{
		if(cur->children[str[i]-'A'] == NULL) cur->children[str[i]-'A'] = newNode();
		cur = cur->children[str[i]-'A'];
	}
	cur->wordIdx = wIdx;
}

int N,M,W;
char s[MAXN][MAXM+5];

char words[MAXW][MAXN+5];

void init()
{
	root = newNode();
	scanf("%d %d %d", &N, &M, &W);
	for(int i=0; i<N; i++) scanf("%s", s[i]);
	
	char word[MAXN+5];
	
	for(int i=0; i<W; i++)
	{
		scanf("%s", word);
		addWord(root, word, i);
	}
}

int dy[8]     ={ -1, -1,  0,  1,  1,  1,  0, -1};
int dx[8]     ={  0,  1,  1,  1,  0, -1, -1, -1};
char dirChr[8]={'A','B','C','D','E','F','G','H'};

inline bool inside (int y, int x) { return(y>=0 and y<N and x>=0 and x<M); }

int foundAt[MAXW][2];
char foundDir[MAXW];

void solve()
{
	Node *cur;
	
	for(int d=0; d<8; d++)
	{
		for(int i=0; i<N; i++)
		{
			for(int j=0; j<M; j++)
			{
				cur=root;
				for(int k=0; inside(i+dy[d]*k, j+dx[d]*k); k++)
				{
					cur = cur->children[s[i+dy[d]*k][j+dx[d]*k] - 'A'];
					if(cur == NULL) break;
					if(cur->wordIdx != NONE)
					{
						foundAt[cur->wordIdx][0]=i;
						foundAt[cur->wordIdx][1]=j;
						foundDir[cur->wordIdx] = dirChr[d];
					}
				}
			}
		}
	}
	
	for(int i=0; i<W; i++)
	{
		printf("%d %d %c\n", foundAt[i][0], foundAt[i][1], foundDir[i]);
	}
	
}


int main()
{
	freopen("crossword.in", "r", stdin);
	freopen("crossword.out", "w", stdout);
	
	init();
	solve();
	
	return 0;
}