#include<cstdio>
using namespace std;
int z,n,K,c1,c2,fir;char s[9][9];
inline bool chk(){
	for(int i=1;i<=n;++i) for(int j=1,flg;j<=n-K+1;++j) if(s[i][j]^'.'){
		flg=1;
		for(int k=j+1;k<j+K&&flg;++k) flg=(s[i][k]==s[i][j]);
		if(flg) return false;
	}
	for(int i=1;i<=n-K+1;++i) for(int j=1,flg;j<=n;++j) if(s[i][j]^'.'){
		flg=1;
		for(int k=i+1;k<i+K&&flg;++k) flg=(s[k][j]==s[i][j]);
		if(flg) return false;
	}
	for(int i=1;i<=n-K+1;++i) for(int j=1,flg;j<=n-K+1;++j) if(s[i][j]^'.'){
		flg=1;
		for(int k=1;k<K&&flg;++k) flg=(s[i+k][j+k]==s[i][j]);
		if(flg) return false;
	}
	for(int i=1;i<=n-K+1;++i) for(int j=K,flg;j<=n;++j) if(s[i][j]^'.'){
		flg=1;
		for(int k=1;k<K&&flg;++k) flg=(s[i+k][j-k]==s[i][j]);
		if(flg) return false;
	}
	return true;
}
inline void print(int t){
	for(int i=1;i<=n;++i) for(int j=1;j<=n;++j){
		if(s[i][j]=='o'&&t%2==fir%2){printf("%d %d\n",i,j);s[i][j]='.';return;}
		if(s[i][j]=='x'&&t%2-fir%2){printf("%d %d\n",i,j);s[i][j]='.';return;}
	}
}
inline void slv(){
	scanf("%d%d",&n,&K);c1=c2=0;
	for(int i=1;i<=n;++i) scanf("%s",s[i]+1);
	for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) c1+=(s[i][j]=='o'),c2+=(s[i][j]=='x');
	if(c1>c2+1||c2>c1+1){printf("NIE\n");return;}
	if(chk()){
		if(c1+c2-n*n){printf("NIE\n");return;}
		if(c1>c2) fir=1;
		else fir=2;
		printf("TAK\n");
		for(int i=1;i<=c1+c2;++i) print(i);
		return;
	}
	for(int i=1;i<=n;++i) for(int j=1;j<=n;++j){
		if(s[i][j]=='o'&&c1>c2-1){
			s[i][j]='.';
			if(chk()){
				--c1;
				if(c1<c2) fir=2;
				else fir=1;
				printf("TAK\n");
				for(int k=1;k<=c1+c2;++k) print(k);
				printf("%d %d\n",i,j);
				return;
			}
			s[i][j]='o';
		}
		if(s[i][j]=='x'&&c2>c1-1){
			s[i][j]='.';
			if(chk()){
				--c2;
				if(c2<c1) fir=1;
				else fir=2;
				printf("TAK\n");
				for(int k=1;k<=c1+c2;++k) print(k);
				printf("%d %d\n",i,j);
				return;
			}
			s[i][j]='x';
		}
	}
	printf("NIE\n");
}
int main(){
	for(scanf("%d",&z);z--;slv());
	return 0;
}