#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz = 1e5 + 5, mod = 1e9 + 7;
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1; cin >> t;
    while(t--) {
        int n, k; cin >> n >> k;
        std::vector<string> v(n);
        for(int i = 0; i < n; i++) cin >> v[i];
        int a = 0, b = 0;
        int a1 = 0, b1 = 0;
        auto f = [&](int i, int j, int x, int y) {
            int crt = 0;
            char cc = v[i][j];
            while(i >= 0 && i < n && j >= 0 && j < n && v[i][j] == cc) {
                crt++;
                i += x;
                j += y;
            }
            return crt;
        };
        std::vector<pair<int,int>> v1, v2;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if(v[i][j] == '.') continue;
                if(v[i][j] == 'x') {
                    a++; 
                    v1.push_back({i + 1, j + 1});
                }
                else {
                    b++; 
                    v2.push_back({i + 1, j + 1});
                }
                int cnt = max({f(i, j, 1, 0), f(i, j, 0, 1), 
                    f(i, j, 1, 1), f(i, j, 1, -1)});
                if(cnt >= k) {
                    if(v[i][j] == 'x') a1++;
                    else b1++;
                } 
            }
        }
        //cout << a << " " << b << " " << a1 << " " << b1 << "\n";
        if(max(a, b) - min(a, b) > 1 || min(a1, b1) > 0 || 
            (a + b != n * n && max(a1, b1) == 0)) {
            cout << "NIE\n";
            continue;
        }
        auto prin = [&]() {
            if(v1.size() < v2.size()) swap(v1, v2);
            cout << "TAK\n";
            while(!v1.empty()) {
                auto [a, b] = v1.back();
                v1.pop_back();
                cout << a << " " << b << "\n";
                if(!v2.empty()) {
                    auto [a, b] = v2.back();
                    v2.pop_back();
                    cout << a << " " << b << "\n";
                } 
            }
        };
        auto khali = [&]() {
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < n; j++) {
                    if(v[i][j] == '.') continue;
                    int cnt = max({f(i, j, 1, 0), f(i, j, 0, 1), 
                        f(i, j, 1, 1), f(i, j, 1, -1)});
                    if(cnt >= k) return 0;
                }
            }
            return 1;
        };
        if(a1 > 0 || b1 > 0) {
            if(b1) swap(v1, v2);
            if(v1.size() < v2.size()) {
                cout << "NIE\n";
                continue;
            }
            int pos = 0;
            for(int i = 0; i < v1.size(); i++) {
                auto [a, b] = v1[i];
                char cc = v[a - 1][b - 1];
                v[a - 1][b - 1] = '.';
                if(khali()) {
                    pos = 1;
                    swap(v1[0], v1[i]);
                    break;
                }
                v[a - 1][b - 1] = cc;
            }
            if(!pos) cout << "NIE\n";
            else {
                if(v1.size() == v2.size()) swap(v1, v2);
                prin();
            } 
        } else prin();
    }
    return 0; 
}