#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 6 + 5;

int n,d;
char s[MAXN][MAXN];

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<pii> ans;

bool check(char c)
{
	if(iswin('o') == -1 || iswin('x') == -1)
		return 0;
	
	vector<pii> 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(void)
{
	scanf("%d%d",&n,&d);
	for(int i=1; i<=n; ++i)
		scanf("%s",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(void)
{
//	freopen("K.out","w",stdout);
	
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}