#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define LC ch[k][0] 
#define RC ch[k][1]
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i = a; i < n; i++)
#define repn(i,a,n) for (int i = a; i <= n; i++)
#define per(i,a,n) for (int i = n - 1; i >= a; i--)
#define pern(i,a,n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;

const int N = 100010;
const int M = 610000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = (LL)1e18;
const double eps = 1e-9;

int n, k, a[7][7], c[3];
vector<PII> p[3], ans;
bool yes = false;
int xi, xj;
vector<PII> dir;

bool check() {
	repn(i, 1, n) {
		repn(j, 1, n) {
			if (a[i][j] == 0) continue;
			repn(d, 0, 3) {
				PII cur = mp(i, j);
				int tp = a[i][j];
				bool can = true;
				rep(t, 1, k) {
					cur.fi += dir[d].fi;
					cur.se += dir[d].se;
					if (cur.fi < 1 || cur.fi > n || cur.se < 1 || cur.se > n) {
						can = false;
						break;
					}
					if (a[cur.fi][cur.se] != tp) can = false;
				}
				if (can) {
					return true;
				}
			}
		}
	}
	return false;
}

void solve() {
	cin >> n >> k;
	yes = false;
	ans.clear();
	c[1] = 0; c[2] = 0;
	p[1].clear(); p[2].clear();
	string s;
	repn(i, 1, n) {
		cin >> s;
		repn(j, 1, n) {
			if (s[j - 1] == '.') a[i][j] = 0;
			else if (s[j - 1] == 'x') {
				a[i][j] = 1; c[1] ++;
				p[1].pb(mp(i, j));
			}
			else {
				a[i][j] = 2; c[2] ++;
				p[2].pb(mp(i, j));
			}
		}
	}
	if (!check() && c[1] + c[2] == n * n) {
		bool can = false;
		if (c[1] == c[2]) {
			can = true;
			int tot = c[1], p1 = 0, p2 = 0;
			repn(i, 1, tot) {
				ans.pb(p[1][p1]); ans.pb(p[2][p2]);
				p1 ++; p2 ++;
			}
		}
		else if (c[1] + 1 == c[2]) {
			can = true;
			int tot = c[1], p1 = 0, p2 = 0;
			repn(i, 1, tot) {
				ans.pb(p[2][p2]); ans.pb(p[1][p1]);
				p1 ++; p2 ++;
			}
			ans.pb(p[2][p2]);
		}
		else if (c[1] == c[2] + 1) {
			can = true;
			int tot = c[2], p1 = 0, p2 = 0;
			repn(i, 1, tot) {
				ans.pb(p[1][p1]); ans.pb(p[2][p2]);
				p1 ++; p2 ++;
			}
			ans.pb(p[1][p1]);
		}
		if (! can) cout << "NIE\n";
		else{
			cout << "TAK\n";
			for (auto x : ans) {
				cout << x.fi << " " << x.se << "\n";
			}
		}
		return;
	}
	if (!check()) {
		cout << "NIE\n"; return;
	}
	repn(i, 1, n) {
		repn(j, 1, n) {
			int cur = a[i][j];
			if (!cur) continue;
			a[i][j] = 0;
			bool can = check();
			a[i][j] = cur;
			if (!can) {
				yes = true; xi = i; xj = j;
				break;
			}
		}
		if (yes) break;
	}
	if (!yes) {
		cout << "NIE\n";
		return;
	}
	int tp = a[xi][xj];
	c[tp] --;
	if (c[tp] == c[3 - tp]) {
		int tot = c[tp], p1 = 0, p2 = 0;
		repn(i, 1, tot) {
			if (p[tp][p1].fi == xi && p[tp][p1].se == xj) p1 ++;
			ans.pb(p[tp][p1]); ans.pb(p[3 - tp][p2]);
			p1 ++; p2 ++;
		}
		ans.pb(mp(xi, xj));
		cout << "TAK\n";
		for (auto x : ans) {
			cout << x.fi << " " << x.se << "\n";
		}
	}
	else if (c[tp] + 1 == c[3 - tp]) {
		int tot = c[tp], p1 = 0, p2 = 0;
		repn(i, 1, tot) {
			if (p[tp][p1].fi == xi && p[tp][p1].se == xj) p1 ++;
			ans.pb(p[3 - tp][p2]); ans.pb(p[tp][p1]); 
			p1 ++; p2 ++;
		}
		ans.pb(p[3 - tp][p2]); 
		ans.pb(mp(xi, xj));
		cout << "TAK\n";
		for (auto x : ans) {
			cout << x.fi << " " << x.se << "\n";
		}
	}
	else cout << "NIE\n";
}

int main()
{
	IO;
	dir.pb(mp(1, 0)); dir.pb(mp(0, 1));
	dir.pb(mp(1, 1)); dir.pb(mp(-1, 1));
	int T;
	cin >> T;
	repn(i, 1, T) solve();
	return 0;
}