#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<vector<int>> a(n + 1, vector<int>(n + 1));
    vector<int> win(3);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            char c;
            cin >> c;
            if (c == 'x')
                a[i + 1][j + 1] = 2;
            if (c == 'o')
                a[i + 1][j + 1] = 1;
        }
    }
    win[1] = win[2] = 0;

    auto test_cal_win = [&]()
    {
        fr(i, 1, n)
        {
            fr(j, 1, n) if (a[i][j])
            {
                int f = 1;

                f = 1;
                fr(l, 0, k - 1) if (i + l > n || a[i + l][j] != a[i][j]) f = 0;
                if (f)
                    win[a[i][j]] = 1;

                f = 1;
                fr(l, 0, k - 1) if (j + l > n || a[i][j + l] != a[i][j]) f = 0;
                if (f)
                    win[a[i][j]] = 1;

                f = 1;
                fr(l, 0, k - 1) if (i + l > n || j + l > n || a[i + l][j + l] != a[i][j]) f = 0;
                if (f)
                    win[a[i][j]] = 1;

                f = 1;
                fr(l, 0, k - 1) if (i + l > n || j - l < 1 || a[i + l][j - l] != a[i][j]) f = 0;
                if (f)
                    win[a[i][j]] = 1;
            }
        }
    };
    test_cal_win();
    if (!win[1] && !win[2]) // no win
    {
        bool f = 1;
        fr(i, 1, n)
        {
            fr(j, 1, n)
            {
                if (a[i][j] == 0)
                    f = 0;
            }
        }
        if (f == 0)
        {
            cout << "NIE" << endl;
            return;
        }
    }

    vector<pii> ans;
    for (int c = 1; c <= 2; c++)
    {
        fr(i, 1, n)
            fr(j, 1, n)
        {
            if (!a[i][j])
                continue;
            int last = a[i][j];
            win[1] = win[2] = 0;
            a[i][j] = 0;
            test_cal_win();
            auto make = [&](int now)
            {
                ans.clear();
                vector<pii> b[3];
                fr(i, 1, n)
                {
                    fr(j, 1, n)
                    {
                        if (!a[i][j])
                            continue;
                        b[a[i][j]].push_back({i, j});
                    }
                }
                while (b[now].size())
                {
                    ans.push_back(b[now].back());
                    b[now].pop_back();
                    now = 3 - now;
                }
                if (b[1].size() || b[2].size())
                    return -1;
                return now;
            };
            if (!win[1] && !win[2])
            {
                int id = make(c);
                if (id == last)
                {
                    cout << "TAK" << endl;
                    for (auto [x, y] : ans)
                        cout << x << " " << y << endl;
                    cout << i << " " << j << endl;
                    return;
                }
            }
            a[i][j] = last;
        }
    }
    cout << "NIE" << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}