#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                           \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
         << ": ";                                          \
    dbgh(__VA_ARGS__)
#else
#define cerr   \
    if (false) \
    cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

template <typename T>
T reversed(T t) {
    reverse(begin(t), end(t));
    return t;
}

template <typename T>
vector<vector<T>> transposed(const vector<vector<T>>& arr) {
    int n = sz(arr), m = sz(arr[0]);
    vector<vector<T>> ans(m, vector<T>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            ans[i][j] = arr[j][i];
        }
    }
    return ans;
}

bool c_win(const vector<vector<char>>& arr, int kv, char c) {
    auto c_row = [&](const vector<vector<char>>& arr) -> bool {
        int n = sz(arr), m = sz(arr[0]);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j + kv <= m; j++) {
                for (int k = 0; k < kv; k++) {
                    if (arr[i][j + k] != c) {
                        goto loop;
                    }
                }
                return true;
            loop:;
            }
        }
        return false;
    };
    auto c_diag = [&](const vector<vector<char>>& arr) -> bool {
        int n = sz(arr), m = sz(arr[0]);
        for (int i = 0; i + kv <= n; i++) {
            for (int j = 0; j + kv <= m; j++) {
                for (int k = 0; k < kv; k++) {
                    if (arr[i + k][j + k] != c) {
                        goto loop;
                    }
                }
                return true;
            loop:;
            }
        }
        return false;
    };
    return c_row(arr) || c_row(transposed(arr)) || c_diag(arr) ||
           c_diag(reversed(arr));
}

void grade(const vector<vector<char>>& arr, int kv, const vector<pair<int, int>>& ans) {
    int n = sz(arr), ord = -1;
    vector<vector<char>> tmp(n, vector<char>(n, '.'));
    for (int i = 0; i < sz(ans); i++) {
        auto& [x, y] = ans[i];
        assert(arr[x][y] == 'x' || arr[x][y] == 'o');
        int cv = (i + (arr[x][y] == 'x')) % 2;
        if (ord == -1) {
            ord = cv;
        }
        assert(ord == cv);
        tmp[x][y] = arr[x][y];
        if (i + 1 < sz(ans)) {
            assert(!c_win(tmp, kv, 'x') && !c_win(tmp, kv, 'o'));
        }
    }
    assert(arr == tmp);
}

void solve() {
    int n, kv;
    cin >> n >> kv;
    vector<vector<char>> arr(n);
    for (auto& a : arr) {
        string s;
        cin >> s;
        a = vector<char>(begin(s), end(s));
    }
    auto tarr = arr;
    vector<pair<int, int>> xs, os;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (arr[i][j] == 'x') {
                xs.emplace_back(i, j);
            } else if (arr[i][j] == 'o') {
                os.emplace_back(i, j);
            }
        }
    }
    auto print_xo = [&]() -> void {
        assert(sz(xs) >= sz(os));
        vector<pair<int, int>> ans;
        for (int k = 0; k < sz(xs) + sz(os); k++) {
            if (k % 2 == 0) {
                ans.push_back(xs[k / 2]);
            } else {
                ans.push_back(os[k / 2]);
            }
        }
        grade(tarr, kv, ans);
        cout << "TAK" << endl;
        for (auto& [x, y] : ans) {
            cout << x + 1 << " " << y + 1 << endl;
        }
    };
    bool bx = c_win(arr, kv, 'x'), bo = c_win(arr, kv, 'o');
    if (bx + bo != 1) {
        if (!bx && !bo && abs(sz(os) - sz(xs)) <= 1) {
            for (auto& a : arr) {
                for (auto& b : a) {
                    if (b == '.') {
                        goto loop;
                    }
                }
            }
            if (sz(os) > sz(xs)) {
                swap(xs, os);
            }
            print_xo();
            return;
        loop:;
        }
        cout << "NIE" << endl;
        return;
    }
    if (bo) {
        for (auto& a : arr) {
            for (auto& b : a) {
                if (b == 'x') {
                    b = 'o';
                } else if (b == 'o') {
                    b = 'x';
                }
            }
        }
        swap(xs, os);
    }
    if (!(sz(xs) == sz(os) || sz(xs) == sz(os) + 1)) {
        cout << "NIE" << endl;
        return;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (arr[i][j] == 'x') {
                auto tmp = arr;
                tmp[i][j] = '.';
                if (c_win(tmp, kv, 'x')) {
                    continue;
                }
                xs.erase(find(begin(xs), end(xs), pair<int, int> {i, j}));
                xs.emplace_back(i, j);
                if (sz(xs) == sz(os)) {
                    swap(xs, os);
                }
                print_xo();
                return;
            }
        }
    }
    cout << "NIE" << endl;
}

int main() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
    int tcs;
    cin >> tcs;
    while (tcs--) {
        solve();
    }
}