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

inline int read(){
	int x=0,f=1;char ch=' ';
	while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0' && ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return f==1?x:-x;
}

const int N=100;

int T,n,k;
char s[N][N];
inline bool check_win(char c){
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			if(s[i][j]!=c)continue;
			if(i+k-1<=n && j+k-1<=n){
				int flag=1;
				for(int t=1;t<k;++t){
					if(s[i+t][j+t]!=c){
						flag=0;
						break;
					}
				}
				if(flag)return 1;
			}
			if(i+k-1<=n && j-k+1>=1){
				int flag=1;
				for(int t=1;t<k;++t){
					if(s[i+t][j-t]!=c){
						flag=0;
						break;
					}
				}
				if(flag)return 1;
			}
			if(i+k-1<=n){
				int flag=1;
				for(int t=1;t<k;++t){
					if(s[i+t][j]!=c){
						flag=0;
						break;
					}
				}
				if(flag)return 1;
			}
			if(j+k-1<=n){
				int flag=1;
				for(int t=1;t<k;++t){
					if(s[i][j+t]!=c){
						flag=0;
						break;
					}
				}
				if(flag)return 1;
			}
		}
	}
	return 0;
}

int px[2][N],py[2][N];

int main(){
	T=read();
	while(T--){
		n=read();k=read();
		int tot=0,cntx=0,cnto=0;
		for(int i=1;i<=n;++i){
			scanf("%s",s[i]+1);
			for(int j=1;j<=n;++j){
				tot+=(s[i][j]=='.');
				cntx+=(s[i][j]=='x');
				cnto+=(s[i][j]=='o');
			}
		}
		bool s1=check_win('x'),s2=check_win('o');
		bool full=(bool)(tot==0);
		if(s1 && s2){
			printf("NIE\n");
			continue;
		}
		if(abs(cntx-cnto)>1){
			printf("NIE\n");
			continue;
		}
		if(!s1 && !s2){
			if(!full){
				printf("NIE\n");
				continue;
			}
			int lenx=0,leno=0;
			for(int i=1;i<=n;++i){
				for(int j=1;j<=n;++j){
					if(s[i][j]=='x'){
						px[0][++lenx]=i;
						py[0][lenx]=j;
					}
					else{
						px[1][++leno]=i;
						py[1][leno]=j;
					}
				}
			}
			int cur;
			if(lenx>=leno)cur=0;
			else cur=1;
			printf("TAK\n");
			int now=n*n;
			while(now--){
				if(!cur){
					printf("%d %d\n",px[cur][lenx],py[cur][lenx]);
					lenx--;
				}
				else{
					printf("%d %d\n",px[cur][leno],py[cur][leno]);
					leno--;
				}
				cur^=1;
			}
			continue;
		}
		if(s2){
			for(int i=1;i<=n;++i){
				for(int j=1;j<=n;++j){
					if(s[i][j]!='.'){
						s[i][j]='x'+'o'-s[i][j];
					}
				}
			}
			swap(cnto,cntx);
		}
		if(cntx<cnto){
			printf("NIE\n");
			continue;
		}
		int sx=0,sy=0;
		for(int i=1;i<=n;++i){
			for(int j=1;j<=n;++j){
				if(s[i][j]=='x'){
					s[i][j]='.';
					if(!check_win('x')){
						sx=i;
						sy=j;
						break;
					}
					s[i][j]='x';
				}
			}
			if(sx)break;
		}
		if(!sx){
			printf("NIE\n");
			continue;
		}
		int lenx=0,leno=0;
		px[0][++lenx]=sx;
		py[0][lenx]=sy;
		for(int i=1;i<=n;++i){
			for(int j=1;j<=n;++j){
				if(s[i][j]=='x'){
					px[0][++lenx]=i;
					py[0][lenx]=j;
				}
				else if(s[i][j]=='o'){
					px[1][++leno]=i;
					py[1][leno]=j;
				}
			}
		}
		int cur;
		if(lenx>leno)cur=0;
		else cur=1;
		printf("TAK\n");
		int now=n*n-tot;
		while(now--){
			if(!cur){
				printf("%d %d\n",px[cur][lenx],py[cur][lenx]);
				lenx--;
			}
			else{
				printf("%d %d\n",px[cur][leno],py[cur][leno]);
				leno--;
			}
			cur^=1;
		}
	}
	return 0;
}