#include <bits/stdc++.h>
using namespace std;
const int N=1010;
int t,n,m,k,mp[N][N],dis1[N][N],dis2[N][N],dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
queue < pair<int,int> > q;
char s[N];
bool chk (int x,int y) {return (x>=1&&y>=1&&x<=n&&y<=m);}
int main () {
	scanf("%d",&t);
	for (int ii=1;ii<=t;ii++) {
		scanf("%d%d%d",&n,&m,&k);
		for (int i=1;i<=n;i++) {
			scanf("%s",s+1);
			for (int j=1;j<=m;j++) {
				if (s[j]=='.') {mp[i][j]=0,dis1[i][j]=0;q.push(make_pair(i,j));}
				else {mp[i][j]=1,dis1[i][j]=1e9;}
				dis2[i][j]=1e9;
			}
		}
		while (q.size()) {
			pair<int,int> a=q.front();
			q.pop();
			for (int i=0;i<=3;i++) {
				int tx=a.first+dx[i],ty=a.second+dy[i];
				if (chk(tx,ty)&&dis1[tx][ty]==1e9) {dis1[tx][ty]=dis1[a.first][a.second]+1;q.push(make_pair(tx,ty));}
			}
		}
		for (int i=1;i<=n;i++) {
			for (int j=1;j<=m;j++) {
				if (dis1[i][j]>k) {dis2[i][j]=0;q.push(make_pair(i,j));}
			}
		}
		while (q.size()) {
			pair<int,int> a=q.front();
			q.pop();
			for (int i=0;i<=3;i++) {
				int tx=a.first+dx[i],ty=a.second+dy[i];
				if (chk(tx,ty)&&dis2[tx][ty]==1e9) {dis2[tx][ty]=dis2[a.first][a.second]+1;q.push(make_pair(tx,ty));}
			}
		}
		int flg=1;
		for (int i=1;i<=n;i++) {
			for (int j=1;j<=m;j++) {
				if (mp[i][j]&&dis2[i][j]>k) {flg=0;break;}
			}
		}
		if (!flg) {printf("NIE\n");}
		else {printf("TAK\n");}
	}
	return 0;
}