#include<bits/stdc++.h>

#pragma GCC optimize ("Ofast")

using namespace std;

#define rep(i,a,b) for(ll i = a; i<b;i++)
#define rrep(i,a,b) for(ll i = b-1; i>=a;i--)
#define trav(x,a) for(auto &x: a)
#define all(v) v.begin(),v.end()
#define sz(v) ll(v.size())

typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;

ll n,k;


bool kInRow(vector<string> board, char c){
    rep(i,0,n)
        rep(j,0,n){
            for(auto [dx,dy]:vector<pll>{{0,1},{1,0},{1,1},{-1,1}}){
                bool all = true;
                rep(l,0,k){
                    ll i1 = i+dx*l;
                    ll j1 = j+dy*l;
                    if(i1<0||i1>=n || j1>=n || board[i1][j1]!=c) all=false;
                }
                if(all) return true;
            }
        }
    return false;
}

bool boardIsDraw(vector<string> board){
    bool draw = true;
    rep(i,0,n)
    rep(j,0,n)
        draw &= board[i][j]!='.';
    return draw;
}

bool boardIsEnd(vector<string> board){
    return kInRow(board,'x') || kInRow(board,'o') || boardIsDraw(board);
}

void solve(){
    cin>>n>>k;

    vector<string> board(n);

    ll xs = 0;
    ll os = 0;
    rep(i,0,n) {
        cin>>board[i];
        rep(j,0,n){
            xs += board[i][j]=='x';
            os += board[i][j]=='o';
        }
    }
    if(abs(xs-os)>1 || !boardIsEnd(board)) {
        cout<<"NIE\n";
        return;
    }

    vl potWinner;
    if(xs>=os) potWinner.push_back('x');
    if(xs<=os) potWinner.push_back('o');

    for(auto wc: potWinner){
        rep(i,0,n){
            rep(j,0,n){
                if(board[i][j]==wc){
                    vector<string> lastBoard = board;
                    lastBoard[i][j] = '.';
                    if(!boardIsEnd(lastBoard)){
                        bool oStart = (os+xs+(wc=='x'))%2;
                        vector<pll> oPos;
                        vector<pll> xPos;
                        rep(i2,0,n) rep(j2,0,n){
                            if(lastBoard[i2][j2]=='x') xPos.emplace_back(i2,j2);
                            if(lastBoard[i2][j2]=='o') oPos.emplace_back(i2,j2);
                        }
                        
                        cout<<"TAK\n";
                        rep(i,0,os+xs-1){
                            if(i%2!=oStart){
                                cout<<oPos.back().first+1<<" "<<oPos.back().second+1<<"\n";
                                oPos.pop_back();
                            } else {
                                cout<<xPos.back().first+1<<" "<<xPos.back().second+1<<"\n";
                                xPos.pop_back();
                            }
                        }
                        cout<<i+1<<" "<<j+1<<"\n";
                        return;
                    }
                }
            }
        }
    }
    cout<<"NIE\n";
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    ll t; cin>>t;

    while(t--) solve();
}