#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 15;
const ll INF = 2e18;

char tb[MAXN][MAXN];

int n, k;

bool valid() {
    int qtx = 0, qto = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(tb[i][j] == 'x') qtx++;
            if(tb[i][j] == 'o') qto++;
        }
    }
    if(abs(qtx - qto) <= 1) return true;
    return false;
}

bool finish() {
    bool fs = false, qt = true;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(tb[i][j] == '.') {
                qt = false;
                continue;
            }
            bool th = true, tv = true, td = true, td1 = true;
            for(int l = 0; l < k; l++) {
                if(i + l > n || tb[i + l][j] != tb[i][j]) th = false;
                if(j + l > n || tb[i][j + l] != tb[i][j]) tv = false;
                if(i + l > n || j + l > n || tb[i + l][j + l] != tb[i][j]) td = false;
                if(i + l > n || j - l < 1 || tb[i + l][j - l] != tb[i][j]) td1 = false;
            }
            if(th || tv || td || td1) fs = true;
        }
    }
    if(qt) return true;
    return fs;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        cin >> n >> k;
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                cin >> tb[i][j];
            }
        }
        if(!finish() || !valid()) {
            cout << "NIE\n";
            continue;
        }
        pii last = {0, 0};
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                char cur = tb[i][j];
                if(cur == '.') continue;
                tb[i][j] = '.';
                if(!finish() && valid()) {
                    last = {i, j};
                }
                tb[i][j] = cur;
            }
        }
        if(last.first == 0) {
            cout << "NIE\n";
            continue;
        }
        int ls = 0;
        if(tb[last.first][last.second] == 'x') ls = 1;
        vector <pii> vx, vo;
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                if(i == last.first && j == last.second) continue;
                if(tb[i][j] == 'x') vx.push_back({i, j});
                else if(tb[i][j] == 'o') vo.push_back({i, j}); 
            }
        }
        if(ls == 0) vo.push_back(last);
        else vx.push_back(last);
        int diff = vx.size() - vo.size(), sum = vx.size() + vo.size();
        cout << "TAK\n";
        if(diff == 0) {
            if(ls == 0) {
                for(int i = 0; i < sum; i++) {
                    int id = i / 2;
                    if(i % 2 == 0) {
                        cout << vx[id].first << ' ' << vx[id].second << '\n';
                    }
                    else {
                        cout << vo[id].first << ' ' << vo[id].second << '\n';
                    }
                }
            }
            else {
                for(int i = 0; i < sum; i++) {
                    int id = i / 2;
                    if(i % 2 == 0) {
                        cout << vo[id].first << ' ' << vo[id].second << '\n';
                    }
                    else {
                        cout << vx[id].first << ' ' << vx[id].second << '\n';
                    }
                }
            }
        }
        else {
            if(ls == 1) {
                for(int i = 0; i < sum; i++) {
                    int id = i / 2;
                    if(i % 2 == 0) {
                        cout << vx[id].first << ' ' << vx[id].second << '\n';
                    }
                    else {
                        cout << vo[id].first << ' ' << vo[id].second << '\n';
                    }
                }
            }
            else {
                for(int i = 0; i < sum; i++) {
                    int id = i / 2;
                    if(i % 2 == 0) {
                        cout << vo[id].first << ' ' << vo[id].second << '\n';
                    }
                    else {
                        cout << vx[id].first << ' ' << vx[id].second << '\n';
                    }
                }
            }
        }
    }
    return 0;
}