#include <bits/stdc++.h>
using namespace std;


const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};

int a[150][150];
const int B=10;
const int lim=30;
int n,m,Q;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int Tcase=1;
	cin >> Tcase;
	for (;Tcase--;){
		cin >> n >> m >> Q;
		vector<pair<int,int>> posb;
		for (int i=1;i<=n;i++){
			string str;
			cin >> str;
			for (int j=1;j<=m;j++){
				if (str[j-1]=='A'){
					a[i][j]=1;
				}
				else if (str[j-1]=='B'){
					posb.emplace_back(i,j);
				}
				else{
					a[i][j]=0;
				}
			}
		}
		string query;
		cin >> query;
		
		bool flag=0;
		for (auto ch:query){
		
			int opt=0;
			if (ch=='S') opt=0;
			else if (ch=='E') opt=1;
			else if (ch=='N') opt=2;
			else if (ch=='W') opt=3;
			
			int step=0;
			for (;step<lim;){
				bool collid=0;
				for (auto [x,y]:posb){
					int nx=x+dx[opt];
					int ny=y+dy[opt];
					if (nx<1 || nx>n) continue;
					if (ny<1 || ny>m) continue;
					if (a[x+dx[opt]][y+dy[opt]]){
						collid=1;
						break;
					}
				}
				if (collid) break;
				step++;
				for (auto &tmp:posb){
					tmp.first+=dx[opt];
					tmp.second+=dy[opt];
				}
			}
			if (step>=lim){
				flag=1;
				break;
			}
		}
		
		if (!flag) cout << "NIE" << "\n";
		else cout << "TAK" << "\n";
		
		for (int i=0;i<=B+5;i++)
			for (int j=0;j<=B+5;j++) a[i][j]=0;
		
	}
	return 0;
}