#include <bits/stdc++.h>
#define V vector
#define Vi vector<int>
#define sz(a) ((int)a.size())
#define fi first
#define se second
#define Int pair<int, int>
#define Inf ((int)1e9)
#define pb push_back
#define ins insert
#define For(i, x, y) for (int i = (x); i <= (y); i++)
#define Rep(i, x, y) for (int i = (x); i >= (y); i--)
#define seg int p, int l, int r
#define lid p << 1, l, mid
#define all(a) a.begin(), a.end()
#define rid p << 1 | 1, mid + 1, r
#define mid ((l + r) / 2)
#define Ceil(x, y) (((x) + (y)-1) / (y))
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define IO(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout);
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int main() {
#ifndef ONLINE_JUDGE
  IO(1);
#endif
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int _, n, m, K;
  for (cin >> _; cin >> n >> m >> K;) {
    V<V<char>> a(n + 5, V<char>(m + 5));
    V<Vi> d(n + 5, Vi(m + 5, -1)), D(d);
    queue<Int> q;
    For(i, 1, n) For(j, 1, m) {
      cin >> a[i][j];
      if (a[i][j] == '.') q.push({i, j}), d[i][j] = 0;
    }
    while (!q.empty()) {
      int x = q.front().fi, y = q.front().se;
      q.pop();
      For(i, 0, 3) {
        int xx = x + dx[i], yy = y + dy[i];
        if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && d[xx][yy] == -1)
          d[xx][yy] = d[x][y] + 1, q.push({xx, yy});
      }
    }
    if (d[1][1] < 0) {
      cout << "TAK\n";
      continue;
    }
    For(i, 1, n) For(j, 1, m) if (d[i][j] > K) D[i][j] = 0, q.push({i, j});
    while (!q.empty()) {
      int x = q.front().fi, y = q.front().se;
      q.pop();
      For(i, 0, 3) {
        int xx = x + dx[i], yy = y + dy[i];
        if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && D[xx][yy] == -1)
          D[xx][yy] = D[x][y] + 1, q.push({xx, yy});
      }
    }
    int ff = 1;
    For(i, 1, n) {
      For(j, 1, m) if (a[i][j] == 'x' && (D[i][j] > K || D[i][j] == -1)) ff = 0;
    }
    if (ff)
      cout << "TAK\n";
    else
      cout << "NIE\n";
  }
}