#ifdef MY_LOCAL
#include "D://competitive_programming/debug/debug.h"
#define debug(x) cerr << "[" << #x<< "]:"<<x<<"\n"
#else
#define debug(x) 
#endif
#define REP(i, n) for(int i = 0; i < (n); i ++)
#define REPL(i,m, n) for(int i = (m); i < (n); i ++)
#define SORT(arr) sort(arr.begin(), arr.end())
#define LSOne(S) ((S)&-(S))
#define sz(X) ((int)X.size())
#define READ(arr) for(auto &a: arr){cin>>a;}
#define SUM(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef tree<int,null_type,less<int>, rb_tree_tag, tree_order_statistics_node_update> ost;
const ll INF = 1e18;

void solve() {
	int n,k;cin>>n>>k;
	vector<string> vec(n);
	READ(vec);

	auto getseq = [&](vector<string> vec, int first1) {
		vii vec1;
		vii vec2;
		REP(i, n) {
			REP(j, n) {
				if (vec[i][j] == 'o') {
					vec1.push_back({i,j});
				} else if (vec[i][j] == 'x') {
					vec2.push_back({i,j});
				} else {}
			}
		}

		vii farr;
		int which = first1;
		int pt1 = 0;
		int pt2 = 0;
		while(pt1 != sz(vec1) || pt2 != sz(vec2)) {
			if (which == 1) {
				// pt2..
				farr.push_back(vec2[pt2++]);
			} else {
				farr.push_back(vec1[pt1++]);
			}
			which =  1 - which;
		}
		return farr;
	};
	auto not_end = [&](vector<string> tosee) {
		vi vdir = {0,1,1,1};
		vi udir = {1,1,0,-1};
		REP(i, n) {
			REP(j, n) {
				if (tosee[i][j] == '.') continue;
				REP(dir, 4) {
					bool good = true;
					REP(kk, k) {
						int ni = i + vdir[dir]*kk;
						int nj = j + udir[dir]*kk;
						if (ni < 0 || ni >= n || nj < 0 || nj >= n) {
							good = false;break;
						} 
						if (tosee[ni][nj] != tosee[i][j]) {
							good = false;break;
						}
					}
					if (good) {
						return false;
					}
				}
				// try all directions..
			}
		}
		return true;
	};
	auto printans = [&](vii &farr) {
		cout<<"TAK\n";
		for (auto [x,y]: farr) {
			cout<<x+1<<" "<<y+1<<"\n";
		}
		return;
	};
	int ct1 = 0;
	int ct2 = 0;
	REP(i, n) {
		REP(j, n) {
			if (vec[i][j] == 'x') {
				ct2++;
			} else if (vec[i][j] == 'o') {
				ct1++;
			} else {

			}
		}
	}
	if (abs(ct1 - ct2) > 1) {
		cout<<"NIE\n";return;
	}
	if (not_end(vec)) {
		if (ct1 + ct2 != n*n) {
			cout<<"NIE\n";
		} else {
			vii farr;
			if (ct1 > ct2) {
				farr = getseq(vec, 0);
			} else {
				farr = getseq(vec, 1);
			}
			printans(farr);
		}return;
	}
	//debug("here!");
	REP(i, n) {
		REP(j, n) {
			if (vec[i][j] == '.') continue;
			if (ct1 >= ct2 && vec[i][j] == 'o') {
				//debug("bo!");
				vector<string> temp = vec;
				temp[i][j] = '.';
				if (not_end(temp)) {
					vii f1 = getseq(temp, ct1 > ct2 ? 0 : 1);
					f1.push_back({i,j});
					printans(f1);return;
				}
			} 
			if (ct2 >= ct1 && vec[i][j] == 'x') {
				//debug("ho!");
				vector<string> temp = vec;
				temp[i][j] = '.';
				if (not_end(temp)) {
					//debug(temp);
					vii f1 = getseq(temp, ct2 > ct1 ? 1 : 0);
					f1.push_back({i,j});
					printans(f1);return;
				}
			}
		}
	}
	cout<<"NIE\n";
	

}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	int tc;
	cin>>tc;
	REP(i, tc) {
		solve();
	}

}