#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 11
int n, k;
string s[N];
vector<pair<int, int>>ans;
void print()
{
	cout << "TAK\n";
	for (auto [x, y] : ans)cout << x << ' ' << y << '\n';
	return ;
}
bool valid(int x, int y, char op) {return (x >= 1 && x <= n && y >= 1 && y <= n && s[x][y] == op);}

int ck(int x, int y)
{
	char op = s[x][y];
	int X[4] = {0, 1, 1, 1}, Y[4] = {1, 0, 1, -1};
	for (int p = 0; p < 4; p ++)
	{
		for (int i = 0; i <= k - 1; i ++)
		{
			int flag = 1;
			for (int j = 1; j <= i; j ++)
			{
				int tx = x + j * X[p], ty = y + j * Y[p];
				if (!valid(tx, ty, op)) {flag = 0; break;}
			}
			if (!flag)continue;
			for (int j = 1; j <= k - 1 - i; j ++)
			{
				int tx = x - j * X[p], ty = y - j * Y[p];
				if (!valid(tx, ty, op)) {flag = 0; break;}
			}
			if (flag)return 1;
		}
	}
	return 0;
}
int ck(int tg)
{
	ans.clear();
	int s0 = 0, s1 = 0;
	vector<pair<int, int>>v0, v1;
	// for (int i = 1; i <= n; i ++)cout << s[i] << '\n';
	for (int i = 1; i <= n; i ++)
	{
		for (int j = 1; j <= n; j ++)
		{
			if (s[i][j] == 'o') {s0 ++, v0.push_back({i, j}); if (ck(i, j))return 0;}
			if (s[i][j] == 'x') {s1 ++, v1.push_back({i, j}); if (ck(i, j))return 0;}
		}
	}
	// cout << "PASS" << endl;
	if (tg == 0) {if (s0 > s1 + 1 || s0 < s1)return 0;}
	if (tg == 1) {if (s1 > s0 + 1 || s1 < s0)return 0;}
	int now = tg;
	while (v0.size() || v1.size())
	{
		if (now == 0)
		{
			if (v0.empty())return 0;
			ans.push_back(v0.back()); v0.pop_back();
		}
		if (now == 1)
		{
			if (v1.empty())return 0;
			ans.push_back(v1.back()); v1.pop_back();
		}
		now ^= 1;
	}
	return 1;
}
void sol()
{
	cin >> n >> k;
	int flag = 0;
	for (int i = 1; i <= n; i ++)
	{
		cin >> s[i];
		s[i] = '.' + s[i];
		for (int j = 1; j <= n; j ++)flag |= (s[i][j] == '.');
	}
	if (!flag && ck(0)) {print(); return ;}
	if (!flag && ck(1)) {print(); return ;}
	for (int i = 1; i <= n; i ++)for (int j = 1; j <= n; j ++)if (s[i][j] != '.')
			{
				if (ck(i, j))
				{
					// cout << "??:" << i << ' ' << j << endl;
					char op = s[i][j]; s[i][j] = '.';
					if (ck(0) && s[ans.back().first][ans.back().second] != op) {ans.push_back({i, j}); print(); return ;}
					if (ck(1) && s[ans.back().first][ans.back().second] != op) {ans.push_back({i, j}); print(); return ;}
					s[i][j] = op;
				}
			}
	cout << "NIE\n";
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T; cin >> T;
	while (T --)sol();
	return 0;
}