#include<bits/stdc++.h>
using namespace std;
string s[6],t[6];
int n,k;
#define pb push_back
void print(int x){printf("%d %d\n",x/n+1,x%n+1);}
bool chk(){
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(t[i][j]!='.'){
		bool fl=1;
		for(int z=0;z<k;z++)if(i+z<n&&j+z<n)fl&=(t[i][j]==t[i+z][j+z]);else fl=0;
		if(fl)return 0;fl=1;
		for(int z=0;z<k;z++)if(i+z<n&&j-z>=0)fl&=(t[i][j]==t[i+z][j-z]);else fl=0;
		if(fl)return 0;fl=1;
		for(int z=0;z<k;z++)if(i+z<n)fl&=(t[i][j]==t[i+z][j]);else fl=0;
		if(fl)return 0;fl=1;
		for(int z=0;z<k;z++)if(j+z<n)fl&=(t[i][j]==t[i][j+z]);else fl=0;
		if(fl)return 0;
	}
	bool fl=1;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)fl&=(t[i][j]!='.');
	if(fl)return 0;
	return 1;
}
void sol(){
	cin>>n>>k;
	for(int i=0;i<n;i++)cin>>s[i];
	int t1=0,t2=0;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++){
		t1+=(s[i][j]=='x');
		t2+=(s[i][j]=='o');
		t[i][j]=s[i][j];
	}
	if(abs(t1-t2)>1||chk()){puts("NIE");return;}
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(s[i][j]!='.'){
		if(s[i][j]=='x'&&t1-t2!=-1||s[i][j]=='o'&&t1-t2!=1){
			t[i][j]='.';
			if(chk()){
				puts("TAK");
				vector<int>p1,p2;
				for(int x=0;x<n;x++)for(int y=0;y<n;y++){
					if(t[x][y]=='x')p1.pb(x*n+y);
					if(t[x][y]=='o')p2.pb(x*n+y);
				}
				if(s[i][j]=='x')p1.pb(i*n+j);
				else p2.pb(i*n+j);
				if(p1.size()<p2.size())swap(p1,p2);
				if(s[i][j]=='x'&&p1.size()==p2.size())swap(p1,p2);
				for(int i=0;i<(int)p1.size();i++){
					print(p1[i]);
					if(i<(int)p2.size())print(p2[i]);
				}
				return;
			}
		}
		t[i][j]=s[i][j];
	}
	puts("NIE");
}
int main(){
	int T;
	cin>>T;while(T--)sol();
	return 0;
}