#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 7;
int T;
int n, m;
string g[N];
bool st[N][N];
int dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int calc(int x, int y, int k, char str)
{
    int res = 0;
    while (x >= 1 && x <= n && y >= 1 && y <= n && g[x][y] == str)
    {
        res++;
        x += dx[k], y += dy[k];
    }
    return res;
}
bool check()
{
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            for (int k = 0; k < 4; k++)
            {
                if (g[i][j] != '.')
                {
                    int cnt = 1 + calc(i + dx[k], j + dy[k], k, g[i][j]) + calc(i + dx[k + 4], j + dy[k + 4], k + 4, g[i][j]);
                    if (cnt >= m)
                        return 1;
                }
            }
        }
    return 0;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> T;
    while (T--)
    {
        cin >> n >> m;
        for (int i = 1; i <= n; i++)
            cin >> g[i], g[i] = ' ' + g[i];
        int type = 0; // 0:NIE 1:WIN 2:DRAW
        PII res;
        if (check())
        {
            for (int i = 1; i <= n && !type; i++)
                for (int j = 1; j <= n && !type; j++)
                {
                    if (g[i][j] == '.')
                        continue;
                    char temp = g[i][j];
                    g[i][j] = '.';
                    if (!check())
                    {
                        res = {i, j};
                        type = 1;
                    }
                    g[i][j] = temp;
                }
            if (!type)
            {
                cout << "NIE" << endl;
                continue;
            }
        }
        else
        {
            type = 2;
            for (int i = 1; i <= n && type == 2; i++)
                for (int j = 1; j <= n && type == 2; j++)
                    if (g[i][j] == '.')
                        type = 0;
            if (!type)
            {
                cout << "NIE" << endl;
                continue;
            }
        }
        vector<PII> arr, brr;
        int a = 0, b = 0; // a:o b:x
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (g[i][j] != '.')
                    if (g[i][j] == 'o')
                    {
                        a++;
                        if (res != (PII){i, j})
                            arr.push_back({i, j});
                    }
                    else
                    {
                        b++;
                        if (res != (PII){i, j})
                            brr.push_back({i, j});
                    }
        if (type == 1)
        {
            if (g[res.x][res.y] == 'o') // o WIN
            {
                if (a == b + 1 || a == b)
                    cout << "TAK" << endl;
                else
                {
                    cout << "NIE" << endl;
                    continue;
                }
                if (arr.size() < brr.size())
                    swap(arr, brr);
                int idx = 0;
                while (idx < arr.size())
                {
                    cout << arr[idx].x << ' ' << arr[idx].y << endl;
                    if (idx < brr.size())
                        cout << brr[idx].x << ' ' << brr[idx].y << endl;
                    idx++;
                }
                cout << res.x << ' ' << res.y << endl;
            }
            else // x WIN
            {
                if (a + 1 == b || a == b)
                    cout << "TAK" << endl;
                else
                {
                    cout << "NIE" << endl;
                    continue;
                }
                if (arr.size() > brr.size())
                    swap(arr, brr);
                int idx = 0;
                while (idx < brr.size())
                {
                    cout << brr[idx].x << ' ' << brr[idx].y << endl;
                    if (idx < arr.size())
                        cout << arr[idx].x << ' ' << arr[idx].y << endl;
                    idx++;
                }
                cout << res.x << ' ' << res.y << endl;
            }
        }
        else // DRAW
        {
            if (a == b || a == b + 1 || a + 1 == b)
                cout << "TAK" << endl;
            else
            {
                cout << "NIE" << endl;
                continue;
            }
            int idx = 0;
            if (arr.size() < brr.size())
                swap(arr, brr);
            while (idx < arr.size())
            {
                cout << arr[idx].x << ' ' << arr[idx].y << endl;
                if (idx < brr.size())
                    cout << brr[idx].x << ' ' << brr[idx].y << endl;
                idx++;
            }
        }
    }
    return 0;
}