#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 ok = true;
    vector<pair<int, int>> x, o;
    vector<pair<int, int>> win;
    bool xw = false;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (g[i][j] == '.') {
          continue;
        }
        (g[i][j] == 'x' ? x : o).push_back({i, j});
        for (int d = 0; d < 4; d++) {
          vector<pair<int, int>> v;
          int p = i;
          int q = j;
          for (int l = 0; l < k; l++) {
            if (p >= n || q >= n || p < 0 || q < 0 || g[p][q] != g[i][j]) {
              break;
            }
            v.push_back({p, q});
            p += DX[d];
            q += DY[d];
          }
          if ((int)v.size() == k) {
            ok &= win.empty();
            win = v;
            xw = g[i][j] == 'x';
          }
        }
      }
    }
    int xs = x.size();
    int os = o.size();
    if (win.empty()) {
      ok &= xs + os == n * n && abs(xs - os) == n % 2;
    } else {
      ok &= abs(xs - os) <= 1 && max(xs, os) == (xw ? xs : os);
    }
    if (!ok) {
      cout << "NIE\n";
    } else {
      cout << "TAK\n";
      if (!win.empty()) {      
        for (auto p : win) {
          auto& v = xw ? x : o;
          v.erase(find(v.begin(), v.end(), p));
          v.push_back(p);
        }
      }
      int i = 0;
      int j = 0;
      while (i + j < xs + os) {
        pair<int, int> p;
        if (i == j) {
          p = ((xs > os || (xs == os && !xw)) ? x[i++] : o[j++]);
        } else {
          p = (i < j ? x[i++] : o[j++]);
        }
        cout << p.first + 1 << ' ' << p.second + 1 << '\n';
      }
    }
  }
}