#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 2137
#endif

const int DX[4] = {1, 0, 1, 1};
const int DY[4] = {-1, 1, 1, 0};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, k;
    cin >> n >> k;
    vector<string> g(n);
    for (int i = 0; i < n; i++) {
      cin >> g[i];
    }
    bool ans = true;
    vector<pair<int, int>> pos[2];
    vector<vector<pair<int, int>>> win;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (g[i][j] != '.') {
          pos[g[i][j] == 'x'].push_back({i, j});
          for (int d = 0; d < 4; d++) {
            int p = i;
            int q = j;
            vector<pair<int, int>> w;
            for (int l = 0; l < k; l++) {
              if (p >= 0 && p < n && q >= 0 && q < n && g[p][q] == g[i][j]) {
                w.push_back({p, q});
                p += DX[d];
                q += DY[d];
              }
            }
            if ((int)w.size() == k) {
              win.push_back(w);
            }
          }
        }
      }
    }
    int s[2] = {(int)pos[0].size(), (int)pos[1].size()};
    ans &= abs(s[0] - s[1]) <= 1;
    int w = -1;
    if (!win.empty()) {
      w = g[win[0][0].first][win[0][0].second] == 'x';
      ans &= s[w] >= s[w ^ 1];
      if ((int)win.size() > 1) {      
        map<pair<int, int>, int> m;
        for (auto& v : win) {
          for (auto [x, y] : v) {
            ans &= (g[x][y] == 'x') == w;
            m[{x, y}]++;
          }
        }
        int cnt = 1;
        pair<int, int> mx = win[0][0];
        for (auto [p, q] : m) {
          if (q > m[mx]) {
            mx = p;
            cnt = 1;
          } else if (q == m[mx]) {
            cnt++;
          }
        }
        ans &= cnt == 1 && m[mx] == (int)win.size();
        for (auto& x : pos[w]) {
          if (x == mx) {
            swap(x, pos[w].back());
          }
        }
      }
    } else {
      ans &= s[0] + s[1] == n * n;
    }
    if (ans) {
      cout << "TAK\n";
      int j = w == -1 ? (s[0] > s[1] ? 0 : 1) : (s[0] == s[1] ? w ^ 1 : w);
      for (int i = 0; i < s[0] + s[1]; i++) {
        cout << pos[j][i / 2].first + 1 << ' ' << pos[j][i / 2].second + 1 << '\n';
        j ^= 1;
      }
    } else {
      cout << "NIE\n";      
    }
  }
}