#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
const int N=15;
int n,d;
char s[N][N];
int iswin(char c)
{
	int cnt=0;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			if(s[i][j]==c)
			{
				++cnt;
				if(i+d-1<=n)
				{
					bool flag=1;
					for(int k=0;k<d&&flag;++k)
						flag&=s[i+k][j]==c;
					if(flag) return -1;
				}
				if(j+d-1<=n)
				{
					bool flag=1;
					for(int k=0;k<d&&flag;++k)
						flag&=s[i][j+k]==c;
					if(flag) return -1;
				}
				if(i+d-1<=n&&j+d-1<=n)
				{
					bool flag=1;
					for(int k=0;k<d&&flag;++k)
						flag&=s[i+k][j+k]==c;
					if(flag) return -1;
				}
				if(i+d-1<=n&&j-d+1>=1)
				{
					bool flag=1;
					for(int k=0;k<d&&flag;++k)
						flag&=s[i+k][j-k]==c;
					if(flag) return -1;
				}
			}
	return cnt;
}
vector<pair<int,int>> ans;
bool check(char c)
{
	if(iswin('o')==-1||iswin('x')==-1)
		return 0;
	vector<pair<int,int>> A,B;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
		{
			if(s[i][j]==c) A.emplace_back(i,j);
			if(s[i][j]==(c^'o'^'x')) B.emplace_back(i,j);
		}
	int delta=(int)A.size()-(int)B.size();
	if(delta<0||delta>1) return 0;
	ans.clear();
	for(int i=0;i<(int)B.size();++i)
		ans.emplace_back(A[i]),ans.emplace_back(B[i]);
	if(delta==1)
		ans.emplace_back(A.back());
	return 1;
}
void solve()
{
	cin>>n>>d;
	for(int i=1;i<=n;++i)
		cin>>s[i]+1;
	int A=iswin('o'),B=iswin('x');
	bool flag=1;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
		{
			if(s[i][j]=='.')
			{
				flag=0;
				continue;
			}
			if(A!=-1&&s[i][j]=='o') continue;
			if(B!=-1&&s[i][j]=='x') continue;
			char c=s[i][j];
			s[i][j]='.';
			if(check(c^'o'^'x'))
			{
				reverse(ans.begin(),ans.end());
				ans.emplace_back(i,j);
				printf("TAK\n");
				for(auto t:ans)
					printf("%d %d\n",t.first,t.second);
				return;
			}
			s[i][j]=c;
		}
	if(flag)
	{
		if(check('x')||check('o'))
		{
			printf("TAK\n");
			for(auto t:ans)
				printf("%d %d\n",t.first,t.second);
			return;
		}
	}
	printf("NIE\n");
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;cin>>T;
	while(T--) solve();
	return 0;
}