#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------


void solve() {
	int n, k; cin >> n >> k;
	vector<vector<int>> v(n + 2);
	rep1(i, n) {
		rep(j, k) {
			int x; cin >> x;
			v[i].push_back(x);
		}
	}
	if (k == 1) {
		cout << "TAK\n";
		cout << 0 << "\n";
		return;
	}
	vector<int> alcs;
	rep1(i, n)rep(j, k)alcs.push_back(v[i][j]);
	vector<P> qcs;
	sort(all(alcs));
	rep(i, alcs.size()) {
		int cnt = 1;
		while (i + 1 < alcs.size() && alcs[i] == alcs[i + 1]) {
			i++; cnt++;
		}
		while (cnt > k) {
			qcs.push_back({ k,alcs[i] });
			cnt -= k;
		}
		qcs.push_back({ cnt,alcs[i] });
	}
	if (qcs.size() > n + 2) {
		cout << "NIE\n"; return;
	}
	sort(all(qcs),greater<P>());

	vector<P> ans;
	auto ord = [&](int i, int j) {
		assert(abs(i - j) == 1);
		assert(v[i].size());
		assert(v[j].size() < k);
		ans.push_back({ i,j });
		v[j].push_back(v[i].back());
		v[i].pop_back();
	};
	auto segord = [&](int i, int j) {
		while (i < j) {
			ord(i, i + 1); i++;
		}
		while (i > j) {
			ord(i, i - 1); i--;
		}
	};
	auto segr = [&](int l) {
		while (l + 1 < v.size() && v[l + 1].size() < k) {
			ord(l, l + 1); l++;
		}
	};
	per1(i, n) {
		rep(j, k)ord(i, i + 1);
	}

	rep(i, qcs.size()) {
		int num = qcs[i].first;
		int col = qcs[i].second;
		//cout << "hello\n";
		//cout << i << " " << num << " " << col << "\n";
		vector<int> prs;


		vector<int> ssrs;
		rep(j, i) {
			int rest = k - v[j].size();
			rep(_, rest)ssrs.push_back(j);
		}
		int stmp = 0;
		while (v[i].size()) {
			int to = ssrs[stmp]; stmp++;
			prs.push_back(to);
			if (v[i].back() == col)num--;
			segord(i, to);
		}
		rep(_, num) {
			//cout << "now " << "\n";
			//rep(j, v.size())coutarray(v[j]);
			int ci = i + 1;
			while (ci < v.size() && v[ci].size() < k)ci++;

			vector<int> rs;
			rep(j, i) {
				int rest = k - v[j].size();
				rep(_, rest)rs.push_back(j);
			}
			for (int j = i + 1; j < ci; j++) {
				int rest = k - 1 - v[j].size();
				rep(_, rest)rs.push_back(j);
			}
			int rest = k - v[i].size();
			rep(_, rest)rs.push_back(i);
			for (int j = i + 1; j < ci; j++) {
				rs.push_back(j);
			}
			int chk = -1, loc = -1;
			for (int j = n + 1; j > i; j--) {
				rep(k, v[j].size()) {
					if (v[j][k] == col) {
						chk = j; loc = k;
					}
				}
			}
			assert(chk >= 0);
			if (chk <= ci) {
				int tmp = 0;
				while (v[chk].back() != col) {
					segord(chk, rs[tmp]);
					tmp++;
				}
				segord(chk, i);
				per(i, tmp) {
					segr(rs[i]);
				}
			}
			else {
				int tmp = 0;
				while (v[chk].back() != col) {
					segord(ci, rs[tmp]); tmp++;
					for (int j = ci + 1; j <= chk; j++) {
						ord(j, j - 1);
					}
				}
				rep(_, 2) {
					segord(ci, rs[tmp]); tmp++;
					for (int j = ci + 1; j < chk; j++) {
						ord(j, j - 1);
					}
				}
				ord(chk, chk - 1);
				while (v[chk].size() < k - 2) {
					if (chk - 2 >= ci) {
						segord(chk - 2, chk);
						for (int j = chk - 3; j >= ci; j--) {
							ord(j, j + 1);
						}
						tmp--;
						segord(rs[tmp], ci);
					}
					else {
						tmp--;
						segord(rs[tmp], chk);
					}
				}
				if (v[chk].size() > k - 2) {
					if (chk - 2 >= ci) {
						segord(ci, rs[tmp]); tmp++;
						for (int j = ci + 1; j <= chk - 2; j++) {
							ord(j, j - 1);
						}
						segord(chk, chk - 2);
					}
					else {
						segord(chk, rs[tmp]); tmp++;
					}
				}
				int cur = chk - 1;
				while (cur > ci) {
					segord(cur - 1, cur + 1);
					segord(cur - 1, cur + 1);
					segord(cur, cur - 1);
					cur--;
				}
				tmp--;
				segord(rs[tmp], cur + 1);
				tmp--;
				segord(rs[tmp], cur + 1);
				segord(cur, i);
				while (tmp > 0) {
					tmp--; segr(rs[tmp]);
				}
			}
			for (int j = v.size() - 2; j > i; j--) {
				while (v[j].size() && v[j + 1].size() < k) {
					segr(j);
				}
			}
		}
		while (prs.size()) {
			int loc = prs.back(); prs.pop_back();
			if (v[loc].back() == col) {
				segord(loc, i);
			}
			else {
				segr(loc);
			}
		}
	}




	cout << "TAK\n";
	cout << ans.size() << "\n";
	rep(i, ans.size()) {
		cout << ans[i].first << " " << ans[i].second << "\n";
	}
	//cout << "last " << "\n";
	//rep(i, n + 2)coutarray(v[i]);
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	int t; cin >> t; rep(i, t)
	solve();
	return 0;
}