#include <bits/stdc++.h>
#define st first
#define nd second 

using namespace std;

bool OK(vector<string>s, int n, int K)
{
	for(int j=0;j<n;j++) {  
		for(int i=0, same = 1;i<n;i++) {
			if(i and s[j][i] == s[j][i-1] and s[j][i] != '.')same++;
			else same = 1;
			if(K == same)return false;
		}
	}
	
	//cout << "jasne" << endl;
	for(int j=0;j<n;j++) {  
		for(int i=0, same = 1;i<n;i++) {
			if(i and s[i][j] == s[i-1][j] and s[i][j] != '.')same++;
			else same = 1;
			if(K == same)return false;
		}
	}

	//cout << "wow" << endl;
	for(int i=0;i<n;i++) {
		for(int j=0;j<n;j++) {
			if(s[j][i] == '.')continue;
			for(int k=0;k<K;k++) {
				if(i+k >= n or j+k >= n)break;
				if(s[j+k][i+k] != s[j][i])break;
				if(k == K-1)return false;
			}

			for(int k=0;k<K;k++) {
				if(i+k >= n or j-k < 0)break;
				if(s[j-k][i+k] != s[j][i])break;
				if(k == K-1)return false;
			}
		}
	}
	return true;
}

void solve() {
	int n, k;
	cin >> n >> k;

	vector<string>v(n);
	for(auto&x:v)cin>>x;
	
	int X=0, O=0;
	for(auto x:v)
		for(auto y:x)
			X+=(y=='x'),O+=(y=='o');
	if( X-O < -1 or 1 < X-O ) { 
		cout << "NIE\n";
		return;
	}

	if(OK(v,n,k) and O+X != n*n) {
		cout << "NIE\n";
		return;
	}

	pair<int,int>last = make_pair(-1,-1);
	if( X >= O ) {
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++) {
				if(v[i][j] != 'x')continue;
				auto temp = v;

				temp[i][j] = '.';
				if(OK(temp,n,k) && last.first == -1) {
					cout << "TAK\n";
					last = make_pair(i,j);
//					return;
				}
			}
	}
	
	if( X <= O ) {
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++) {
				if(v[i][j] != 'o')continue;
				auto temp = v;

				temp[i][j] = '.';
				if(OK(temp,n,k) && last.first == -1) {
					cout << "TAK\n";
					last = make_pair(i,j);
//					return;
				}
			}
	}
	if(last==make_pair(-1,-1)) {
		cout << "NIE\n";
		return;
	}

	stack<pair<int,int>>s;
	s.push(last);
	char wow = v[last.first][last.second];
	v[last.first][last.second] = '.';

	if(wow == 'x')X--;
	else O--;

	while(X + O)
	{
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
			{
				if(v[i][j] != wow and v[i][j] != '.')
				{
					s.push(make_pair(i,j));
					wow = v[i][j];
					v[i][j] = '.';
					
					if(wow == 'x')X--;
					else O--;
				}
			}
	}

	while(!s.empty()) {
		cout << s.top().first+1 << " " << s.top().second+1 << '\n';
		s.pop();
	}
	
	// cout << "NIE\n";
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int t; cin >> t;
	while(t--) solve();
}