uva 10010

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
char ch[50][50];
char find[20][80];
int m, n, t, T;
int equal( int y, int x, int len, int turn )
{
	int i, j, k, flag[8], value;
	for( i = 0; i < 8; i++ )
		flag[i] = 1;
		
	for( i = x, j = 0; j < len; j++, i++ )
	{
		if( i >= n || ch[y][i] != find[turn][j] )
		{
			flag[0] = 0;
			break;
		}
	}
	
	for( i = x, j = 0; j < len; j++, i-- )
	{
		if( i < 0 ||  ch[y][i] != find[turn][j] )
		{
			flag[1] = 0;
			break;
		}
	}
	
	for( i = y, j = 0; j < len; j++, i++ )
	{
		if( i >= m || ch[i][x] != find[turn][j] )
		{
			flag[2] = 0;
			break;
		}
	}
	
	for( i = y, j = 0; j < len; j++, i-- )
	{
		if( i < 0 || ch[i][x] != find[turn][j] )
		{
			flag[3] = 0;
			break;
		}
	}
	
	for( i = x, j = y, k = 0; k < len; i++, j++, k++ )
	{
		if( (i >= n || j >= m) || ch[j][i] != find[turn][k] )
		{
			flag[4] = 0;
			break;
		}
	}
	
	for( i = x, j = y, k = 0; k < len; i--, j--, k++ )
	{
		if( (i < 0 || j < 0) || ch[j][i] != find[turn][k] )
		{
			flag[5] = 0;
			break;
		}
	}
	
	for( i = x, j = y, k = 0; k < len; i++, j--, k++ )
	{
		if( (i >= n || j < 0) || ch[j][i] != find[turn][k] )
		{
			flag[6] = 0;
			break;
		}
	}
	
	for( i = x, j = y, k = 0; k < len; i--, j++, k++ )
	{
		if( (i < 0 || j >= m) || ch[j][i] != find[turn][k] )
		{
			flag[7] = 0;
			break;
		}
	}
	value = flag[0] | flag[1] | flag[2] | flag[3] | flag[4] | flag[5] | flag[6] | flag[7];
	return value; 
};
void find_ch( int turn )
{
	int i, j, len;
	len = strlen( find[turn] );
	for( i = 0; i < m; i++ )
		for( j = 0; j < n; j++ )
			if( ch[i][j] == find[turn][0] && equal( i, j, len, turn ) )
			{
				printf( "%d %d\n", i+1, j+1 );
				return ;
			}
};
void lower( int turn )
{
	int len, i; 
	len = strlen(find[turn]);
	for( i = 0; i < len; i++ )
		find[turn][i] = tolower(find[turn][i]);
}
int main()
{
	
	int i, j, k, temp;
	scanf( "%d\n", &T );
	while( T-- )
	{
		scanf( "%d %d\n", &m, &n );
		for( i = 0; i < m; i++ )
		{
			for( j = 0; j < n; j++ )
			{
				scanf( "%c", &temp );
				ch[i][j] = tolower( temp );
			}
			scanf( "\n" );
		}
		scanf( "%d\n", &t );
		for( i = 0; i < t; i++ )
		{
			gets( find[i] );
			lower( i );
			find_ch( i );
		}
		if( T != 0)
			printf( "\n" );
	}
	return 0;
}