#include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
using namespace std;
int t,n,k,tot,head[2],tail[2],ed;
char ch[6][6];
pair<int,int> p[2][40],ep,w[4];
int endg(){
	int tmp=0;
	for (int i=0;i<n;i++)
	for (int j=0;j<n;j++)
	if (ch[i][j]!='.'){
		tmp+=1;
		for (int h=0;h<4;h++){
			int f=1;
			for (int kk=1;kk<k;kk++)
			if (i+kk*w[h].fi<0||i+kk*w[h].fi>=n||j+kk*w[h].se>=n||ch[i+kk*w[h].fi][j+kk*w[h].se]!=ch[i][j]){
				f=0;
				break;
			}
			if (f) return 1;
		}
	}
	if (tmp==n*n) return 1;
	return 0;
}
int check(){
	tot=0;
	tail[0]=tail[1]=0;
	ed=2;
	for (int i=0;i<n;i++)
	for (int j=0;j<n;j++)
	if (ch[i][j]!='.'){
		tot++;
		int typ;
		if (ch[i][j]=='x') typ=0;
		else if (ch[i][j]=='o') typ=1;
		p[typ][tail[typ]++]=mp(i,j);
		if (endg()){
			char tmp;
			tmp=ch[i][j];
			ch[i][j]='.';
			if (!endg()){
				ed=typ;
				ep=mp(i,j);
			}
			ch[i][j]=tmp;
		}
	}
	if (ed==2) return 2;
	//printf("%d %d\n",ep.fi,ep.se);
	for (int i=0;i<tail[ed];i++)
	if (p[ed][i]==ep) swap(p[ed][i],p[ed][tail[ed]-1]);
	if (tail[ed]==tail[ed^1]) return ed^1;
	if (tail[ed]==tail[ed^1]+1) return ed;
	return 2;
}
int main(){
	//freopen("K.in","r",stdin);
	w[0]=mp(1,0);
	w[1]=mp(0,1);
	w[2]=mp(1,1);
	w[3]=mp(-1,1);
	scanf("%d",&t);
	while (t--){
		scanf("%d%d",&n,&k);
		for (int i=0;i<n;i++) scanf("%s",ch[i]);
		int f=check();
		if (f<2){
			printf("TAK\n");
			head[0]=head[1]=0;
			for (int i=0;i<tot;i++){
				printf("%d %d\n",p[f][head[f]].fi+1,p[f][head[f]].se+1);
				head[f]++;
				f^=1;
			}
		}
		else printf("NIE\n");
	}
}