#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

void solve() {
  int n, m, k;
  cin >> n >> k;
  m = n;

  vector<string> s(n);
  for (int i = 0; i < n; ++i)
    cin >> s[i];

  int nx = 0, no = 0, lib = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (s[i][j] == 'x')
        ++nx;
      else if (s[i][j] == 'o')
        ++no;
      else
        ++lib;
    }
  }

  auto check_win = [&]() {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        if (s[i][j] == '.')
          continue;

        bool ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(j + t < n && s[i][j] == s[i][j + t]))
            ok = false;
        }
        if (ok)
          return true;

        ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(i + t < n && s[i][j] == s[i + t][j]))
            ok = false;
        
        }
        if (ok)
          return true;
        
        ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(j + t < n && i + t < n && s[i][j] == s[i + t][j + t]))
            ok = false;
        }
        if (ok)
          return true;
        
        ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(j - t >= 0 && i + t < n && s[i][j] == s[i + t][j - t]))
            ok = false;
        }
        if (ok)
          return true;
      }
    }

    return false;
  };

  auto who_wins = [&]() {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        if (s[i][j] == '.')
          continue;

        bool ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(j + t < n && s[i][j] == s[i][j + t]))
            ok = false;
        }
        if (ok)
          return s[i][j];

        ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(i + t < n && s[i][j] == s[i + t][j]))
            ok = false;
        
        }
        if (ok)
          return s[i][j];
        
        ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(j + t < n && i + t < n && s[i][j] == s[i + t][j + t]))
            ok = false;
        }
        if (ok)
          return s[i][j];
        
        ok = true;
        for (int t = 1; t < k; ++t) {
          if (!(j - t >= 0 && i + t < n && s[i][j] == s[i + t][j - t]))
            ok = false;
        }
        if (ok)
          return s[i][j];
      }
    }

    return '.';
  };

  if (no > nx || (who_wins() == 'x' && no == nx)) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        if (s[i][j] == 'o')
          s[i][j] = 'x';
        else if (s[i][j] == 'x')
          s[i][j] = 'o';
      }
    }
    swap(no, nx);
  }

  if (no + 1 < nx || (!check_win() && lib > 0)) {
    cout << "NIE\n";
    return;
  }

  vector<pair<int, int>> ans;
  while (no > 0 || nx > 0) {
    char ch = 'x';
    bool found = false;
    if (no == nx)
      ch = 'o';

    for (int i = 0; i < n && !found; ++i) {
      for (int j = 0; j < n; ++j) {
        if (s[i][j] == ch) {
          s[i][j] = '.';
          if (!check_win()) {
            found = true;
            ans.push_back({i, j});
            break;
          }
          s[i][j] = ch;
        }
      }
    }

    if (!found) {
      cout << "NIE\n";
      return;
    }

    if (no == nx)
      --no;
    else
      --nx;
  }

  cout << "TAK\n";
  reverse(ans.begin(), ans.end());
  for (auto it : ans)
    cout << it.first + 1 << " " << it.second + 1 << endl;
}

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

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}