#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000005;
\
int win[2],a[10][10],n,k;

void calcwin(){
    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= n;j ++){
            if(a[i][j]){
                int flg = 1;
                flg = 1; for(int l = 0;l < k;l ++) if(i + l > n || a[i + l][j] != a[i][j]) flg = 0;
                if(flg) win[a[i][j]] = 1;
                flg = 1; for(int l = 0;l < k;l ++) if(j + l > n || a[i][j + l] != a[i][j]) flg = 0;
                if(flg) win[a[i][j]] = 1;
                flg = 1; for(int l = 0;l < k;l ++) if(i + l > n || j + l > n || a[i + l][j + l] != a[i][j]) flg = 0;
                if(flg) win[a[i][j]] = 1;
                flg = 1; for(int l = 0;l < k;l ++) if(i + l > n || j - l < 1 || a[i + l][j - l] != a[i][j]) flg = 0;
                if(flg) win[a[i][j]] = 1;
            }
        }
    }
}
using pii = pair<int,int>;
vector<pii>ans;
int solve(int st){
    ans.clear();
    int now = st;
    vector<pii>A[3];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(a[i][j])A[a[i][j]].push_back(pii(i,j));
    while(!A[now].empty()){
        ans.push_back(A[now].back());
        A[now].pop_back();
        now=3-now;
    }
    if(!A[1].empty()||!A[2].empty())return -1;
    return now;
}
int main(){
    ios::sync_with_stdio(false);
    int TC;
    cin >> TC;
    while(TC --){
        cin >> n >> k;
        memset(a,0,sizeof(a));
        for(int i = 1;i <= n;i ++){
            for(int j = 1;j <= n;j ++){
                char ch; cin >> ch;
                if(ch == 'o') a[i][j] = 1;
                if(ch == 'x') a[i][j] = 2;
            }
        }
        win[1]=win[2]=0;
        calcwin();
        if(!win[1]&&!win[2]){
            bool flg = 1;
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++)
                    if(a[i][j]==0)flg=0;
            if(!flg){
                puts("NIE");
                continue;
            }
        } 
        bool flg = 0;
        for(int c=1;!flg&&c<=2;c++){

            for(int i=1;!flg&&i<=n;i++)
                for(int j=1;!flg&&j<=n;j++)if(a[i][j]>0){
                    int last = a[i][j];
                    win[1]=win[2]=0;
                    a[i][j] = 0;
                    calcwin();
                    if(!win[1]&&!win[2]){
                        int id = solve(c);
                        if(id!=last);
                        else{
                            puts("TAK");
                            flg = 1;
                            for(auto &[x,y]: ans)printf("%d %d\n",x,y);
                            printf("%d %d\n",i,j);
                        }
                    }
                    a[i][j]=last;
                } 
            
        }
        if(!flg)puts("NIE");
    }
    return 0;
}