#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int n,k;
char board[8][8];
int s[8][8];
vector<pair<int,int>> v[3];

int tate[3][8][8];
int yoko[3][8][8];
int rd[3][8][8];
int ld[3][8][8];

int tr(char c){
    if(c == '.')return 0;
    else if(c == 'o')return 1;
    else return 2;
}

void NO(){
    cout << "NIE" << "\n";
}

void solve(){
    int sz1 = v[1].size();
    int sz2 = v[2].size();
    int bit = 0;
    if(sz1-1 == sz2) bit = 1;
    else if(sz2-1 == sz1) bit = 2;
    else if(sz1 == sz2) bit = 3;
    else{
        NO();
        return;
    }
    bool f = false;
    int tc = 0;
    int yc = 0;
    int rdc = 0;
    int ldc = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if(j+k <= n){
                for (int l = 0; l < k; ++l) {
                    yoko[s[i][j+l]][i][j]++;
                }
            }
            if(i+k <= n){
                for (int l = 0; l < k; ++l) {
                    tate[s[i+l][j]][i][j]++;
                }
            }
            if(i+k <= n and j+k <= n){
                for (int l = 0; l < k; ++l) {
                    rd[s[i+l][j+l]][i][j]++;
                }
            }
            if(i+k <= n and k-1 <= j){
                for (int l = 0; l < k; ++l) {
                    ld[s[i+l][j-l]][i][j]++;
                }
            }
            for (int l = 1; l < 3; ++l) {
                if(tate[l][i][j] == k){
                    tc++;
                }
                if(yoko[l][i][j] == k){
                    yc++;
                }
                if(rd[l][i][j] == k){
                    rdc++;
                }
                if(ld[l][i][j] == k){
                    ldc++;
                }
            }
        }
    }
    if(tc+yc+rdc+ldc != 0) f = true;
    if(!f and v[0].size() != 0){
        NO();
        return;
    }
//    cerr << bit << endl;
//    cerr << tc << " " << yc << " " << rdc << " " << ldc << endl;
    vector<pair<int,int>> res;
    int last = -1;
    for (int r = 1; r < 3; ++r) {
        // rを取り除く
        if(bit&r){
            for (int p = 0; p < v[r].size(); ++p) {
                auto [x,y] = v[r][p];
                {
                    int cnt = 0;
                    for (int i = 0; i < k; ++i) {
                        int ny = y-i;
                        if(0 <= ny and yoko[r][x][ny] == k){
                            cnt++;
                        }
                    }
                    if(cnt != yc) continue;
                }
                {
                    int cnt = 0;
                    for (int i = 0; i < k; ++i) {
                        int nx = x-i;
                        if(0 <= nx and tate[r][nx][y] == k){
                            cnt++;
                        }
                    }
                    if(cnt != tc) continue;
                }
                {
                    int cnt = 0;
                    for (int i = 0; i < k; ++i) {
                        int nx = x-i;
                        int ny = y-i;
                        if(0 <= nx and 0 <= ny and rd[r][nx][ny] == k){
                            cnt++;
                        }
                    }
                    if(cnt != rdc) continue;
                }
                {
                    int cnt = 0;
                    for (int i = 0; i < k; ++i) {
                        int nx = x-i;
                        int ny = y+i;
                        if(0 <= nx and ny < n and ld[r][nx][ny] == k){
                            cnt++;
                        }
                    }
                    if(cnt != ldc) continue;
                }
                // ここまで来たらおっけー
                last = r;
                res.push_back({x,y});
                swap(v[r][p], v[r].back());
                v[r].pop_back();
                break;
            }
            if(last != -1) break;
        }
    }
    if(last == -1){
        NO();
        return;
    }
    else{
        while (v[3-last].size()){
            last = 3-last;
            res.push_back(v[last].back());
            v[last].pop_back();
        }
    }
    reverse(res.begin(), res.end());
    cout << "TAK" << "\n";
    for(auto &p:res){
        cout << p.first+1 << " " << p.second+1 << "\n";
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while (q--){
        cin >> n >> k;
        v[0].clear();
        v[1].clear();
        v[2].clear();
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                cin >> board[i][j];
                s[i][j] = tr(board[i][j]);
                v[s[i][j]].push_back({i,j});
                for (int l = 0; l < 3; ++l) {
                    tate[l][i][j] = yoko[l][i][j] = rd[l][i][j] = ld[l][i][j] = 0;
                }
            }
        }
        solve();
    }
}