#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<string> tab(n);
    for (int i = 0; i < n; ++i) {
        cin >> tab[i];
    }

    vector<pair<int, int>> posx;
    vector<pair<int, int>> poso;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (tab[i][j] == 'x') posx.push_back({i, j});
            if (tab[i][j] == 'o') poso.push_back({i, j});
        }
    }

    vector<int> dx = {-1, 0, 1, 1};
    vector<int> dy = {1, 1, 1, 0};

    auto check = [&](int i, int j) {
        return 0 <= i && i < n && 0 <= j && j < n;
    };

    auto get_win = [&](char who, pair<int, int>& where) {
        vector<vector<int>> cntt(n, vector<int>(n, 0));
        int cnt = 0;

        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                for (int d = 0; d < 4; ++d) {
                    bool good = true;
                    for (int t = 0; t < k; ++t) {
                        int i1 = i + dx[d] * t;
                        int j1 = j + dy[d] * t;
                        if (!check(i1, j1) || tab[i1][j1] != who) {
                            good = false;
                            break;
                        }
                    }

                    if (good) {
                        cnt++;
                        for (int t = 0; t < k; ++t) {
                            int i1 = i + dx[d] * t;
                            int j1 = j + dy[d] * t;
                            cntt[i1][j1]++;
                        }

                    }
                }
            }
        }

        if (cnt == 0) {
            where = {-2, -2};
            return;
        }

        where = {-1, -1};
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (cntt[i][j] == cnt) {
                    where = {i, j};
                }
            }
        }
    };

    auto play = [](vector<pair<int, int>> p1, vector<pair<int, int>> p2) {
        if (p1.size() != p2.size() && p1.size() != p2.size() + 1) {
            cout << "NIE\n";
            return;
        } else {
            cout << "TAK\n";
            for (int i = 0; i < p1.size(); ++i) {
                cout << p1[i].first + 1 << ' ' << p1[i].second + 1 << '\n';
                if (i < p2.size()) {
                    cout << p2[i].first + 1 << ' ' << p2[i].second + 1 << '\n';
                }
            }
            return;
        }
    };

    pair<int, int> wx;
    get_win('x', wx);

    pair<int, int> wo;
    get_win('o', wo);

    if (wx.first == -2 && wo.first == -2) {
        if (poso.size() + posx.size() == n * n) {
            if (poso.size() > posx.size()) {
                play(poso, posx);
            } else {
                play(posx, poso);
            }
            return;
        } else {
            cout << "NIE\n";
            return;            
        }

    }
    if (wx.first != -2 && wo.first != -2) {
        cout << "NIE\n";
        return;
    }
    if (wx.first == -1 || wo.first == -1) {
        cout << "NIE\n";
        return;
    }

    if (wo.first == -2) {
        // wins x;
        auto it = find(posx.begin(), posx.end(), wx);
        swap(*it, posx.back());

        if (posx.size() > poso.size()) {
            play(posx, poso);
        } else if (poso.size() == poso.size()) {
            play(poso, posx);
        } else {
            cout << "NIE\n";
            return;
        }
    }

    if (wx.first == -2) {
        // wins 0;
        auto it = find(poso.begin(), poso.end(), wo);
        swap(*it, poso.back());

        if (poso.size() > posx.size()) {
            play(poso, posx);
        } else if (poso.size() == posx.size()) {
            play(posx, poso);
        } else {
            cout << "NIE\n";
            return;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;
    while (t--) solve();

    return 0;
}