#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

struct S {
    int res, x, y, dx, dy; // -1, 0, 1
};

void solve() {
    int n, k;
    cin >> n >> k;
    vector<vector<int>> v(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < n; j++)
            if (s[j] == 'o')
                v[i][j] = 1;
            else if (s[j] == 'x')
                v[i][j] = -1;
    }
    int any = false;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (v[i][j] == 0)
                any = true;
    auto in = [&](int x, int y) {
        return x >= 0 && x < n && y >= 0 && y < n;
    };
    auto chk_win_single = [&](int dx, int dy) -> S {
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (v[i][j] != 0 && in(i + (k - 1) * dx, j + (k - 1) * dy)) {
                    bool ok = true;
                    int x = i, y = j;
                    for (int t = 1; t < k; t++) {
                        x += dx, y += dy;
                        if (v[i][j] != v[x][y]) {
                            ok = false;
                            break;
                        }
                    }
                    if (ok)
                        return {v[i][j], i, j, dx, dy};
                }
        return {0, -1, -1, -1, -1};
    };
    auto chk_win = [&]() -> S {
        const vector<pii> opt = {{0, 1}, {1, 0}, {1, 1}, {1, -1}};
        for (auto [dx, dy] : opt) {
            auto s = chk_win_single(dx, dy);
            if (s.res)
                return s;
        }
        return {0, -1, -1, -1, -1};
    };
    auto can_play = [&](int x) { 
        int y = x * -1; 
        int cx = 0, cy = 0;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (v[i][j] == x)
                    cx++;
                else if (v[i][j] == y)
                    cy++;
        if (cx == cy)
            return x;
        else if (cx == cy + 1)
            return y;
        else
            return 0;
    };
    auto play = [&](int x) {
        cout << "TAK" << "\n";
        int y = x * -1; 
        queue<pii> vx, vy;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (v[i][j] == x)
                    vx.push({i, j});
                else if (v[i][j] == y)
                    vy.push({i, j});
        for (int now = x, nxt = y; ; swap(now, nxt)) {
            auto &q = (now == x ? vx : vy);
            if (!SZ(q))
                break;
            cout << q.front().X + 1 << " " << q.front().Y + 1 << "\n";
            q.pop();
        }
    };
    auto p = chk_win();
    if (!p.res) {
        if (any)
            cout << "NIE\n";
        else if (can_play(1))
            play(1);
        else if (can_play(-1))
            play(-1);
        else
            cout << "NIE\n";
        return;
    }
    for (int i = 0; i < k; i++) {
        int x = p.x + i * p.dx;
        int y = p.y + i * p.dy;
        v[x][y] = 0;
        if (chk_win().res == 0) {
            if (can_play(1) == p.res) {
                play(1);
                cout << x + 1 << " " << y + 1 << "\n";
            }
            else if (can_play(-1)) {
                play(-1);
                cout << x + 1 << " " << y + 1 << "\n";
            }
            else
                cout << "NIE\n";
            return;
        }
        v[x][y] = p.res;
    }
    cout << "NIE\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        solve();
}