#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define INF 1000000000
#define INFl 1000000000000000000
#define all(x) x.begin(), x.end()
#define sajz(x) (int)x.size()
#define pb push_back
#define se second
#define fi first
#define yes puts("YES")
#define no puts("NO")
#define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));}
using namespace std;
//using namespace __gnu_pbds;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

//#define int ll

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef set<int> si;
typedef multiset<int> msi;
typedef long double ld;
//typedef cc_hash_table<int, int, hash<int>> ht;

const int N = 6;

int a[N][N];
int ox[4] = {-1, -1, 0, 1};
int oy[4] = {0, 1, 1, 1};

bool in(int x, int y, int n) {
    return x >= 0 && x < n && y >= 0 && y < n;
}

bool winning(int player, int n, int k) {
    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            for (int d = 0; d < 4; d ++) {
                int cnt = 0, x = i, y = j;

                while (in(x, y, n) && a[x][y] == player) {
                    cnt ++;
                    x += ox[d];
                    y += oy[d];
                }

                if (cnt >= k) return true;
            }
        }
    }

    return false;
}

int Count(int player, int n) {
    int cnt = 0;
    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            if (a[i][j] == player) cnt ++;
        }
    }
    return cnt;
}

void test_case() {
    int n, k;
    cin >> n >> k;

    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            char z; cin >> z;
            if (z == 'o') a[i][j] = 0;
            else if (z == 'x') a[i][j] = 1;
            else a[i][j] = 2;
        }
    }

    vector<vector<pii>> pos(2);
    for (int player = 0; player < 2; player ++) {
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < n; j ++) {
                if (a[i][j] == player) pos[player].pb({i, j});
            }
        }
    }

    int c0 = Count(0, n), c1 = Count(1, n);

    if (abs(c0 - c1) > 1) {
        cout << "NIE\n";
        return;
    }

    int blank = n * n - c0 - c1;
    bool w0 = winning(0, n, k), w1 = winning(1, n, k);

    if (w0 && w1) {
        cout << "NIE\n";
        return;
    }

    if ((w0 && c0 < c1) || (w1 && c1 < c0)) {
        cout << "NIE\n";
        return;
    }

    if (w0 || w1) {
        pii special = {-1, -1};
        for (int player = 0; player < 2; player ++) {
            for (int i = 0; i < n; i ++) {
                for (int j = 0; j < n; j ++) {
                    if (a[i][j] == player && winning(player, n, k)) {
                        a[i][j] = 2;
                        bool w = winning(player, n, k);
                        a[i][j] = player;
                        if (!w) {
                            special = {i, j};
                            break;
                        }
                    }
                }
            }
        }

        //cout << special.first << ' ' << special.second << '\n';

        if (special.first == -1) {
            cout << "NIE\n";
            return;
        }

        cout << "TAK\n";
        vi vec = {0, 1};
        if (c1 > c0 || (c1 == c0 && a[special.first][special.second] == 0)) swap(vec[0], vec[1]);

        while (pos[vec[0]].size() > 0) {
            if (make_pair(pos[vec[0]].back().first, pos[vec[0]].back().second) == special) {
                pos[vec[0]].pop_back();
                continue;
            }
            //cout << vec[0] << ' ';
            cout << pos[vec[0]].back().first+1 << ' ' << pos[vec[0]].back().second+1 << '\n';
            pos[vec[0]].pop_back();
            swap(vec[0], vec[1]);
        }

        cout << special.first+1 << ' ' << special.second+1 << '\n';
    }
    else {
        if (blank) {
            cout << "NIE\n";
            return;
        }        
        cout << "TAK\n";
        vi vec = {0, 1};
        if (c1 > c0) swap(vec[0], vec[1]);

        while (pos[vec[0]].size() > 0) {
            cout << pos[vec[0]].back().first+1 << ' ' << pos[vec[0]].back().second+1 << '\n';
            pos[vec[0]].pop_back();
            swap(vec[0], vec[1]);
        }
    }
}
 
int32_t main() {
	ios_base::sync_with_stdio(false);
	cout.tie(0);
	cin.tie(0);

    int z;
    cin >> z;
    while (z--) {
        test_case();
    }

    return 0;
}