#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
  int T;cin>>T;int pd=0;
  while(T--){int R,C;cin>>R>>C;if(pd++)cout<<endl;
    vector<string>a(R);
    for(auto&s:a){cin>>s;for(auto&c:s)c=tolower(c);}
    int K;cin>>K;
    while(K--){string s;cin>>s;for(auto&c:s)c=tolower(c);
      int ds[8][2]={{+1,0},{0,+1},{+1,+1},{-1,+1}
                   ,{-1,0},{0,-1},{-1,-1},{+1,-1}};
      int succ=0;int y,x,d;
      for(y=-1;!succ&&++y<R;){
      for(x=-1;!succ&&++x<C;){
      for(d=-1;!succ&&++d<8;){
        succ=1;
        for(int k=0;k<s.size();k++){
          int nx=x+k*ds[d][0];int ny=y+k*ds[d][1];
          if(nx<0||nx>=C||ny<0||ny>=R){succ=0;break;}
          if(a[ny][nx]!=s[k]){succ=0;break;}
        }
        if(succ)break;
      }}}
      if(succ)printf("%d %d\n",y+1,x+1);
    }
	}
  return 0;
}