#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

const int INF = 1e9;

string mp[1005];
int dis[1005][1005], n, m;
int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};

void bfs(vector<pii> st) {
    queue<pii> q;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            dis[i][j] = INF;
    auto relax = [&](int x, int y, int d) {
        if (x < 0 || x >= n || y < 0 || y >= m) return;
        if (dis[x][y] > d) {
            dis[x][y] = d;
            q.push(pii(x, y));
        }
    };
    for (auto [x, y] : st)
        relax(x, y, 0);
    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        for (int i = 0; i < 4; ++i)
            relax(x + dx[i], y + dy[i], dis[x][y] + 1);
    }
}

void solve() {
    int k;
    cin >> n >> m >> k;
    for (int i = 0; i < n; ++i)
        cin >> mp[i];
    vector<pii> dot;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            if (mp[i][j] == '.')
                dot.pb(pii(i, j));
    bfs(dot);
    vector<pii> color;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            if (dis[i][j] > k)
                color.pb(pii(i, j));
    bfs(color);
    int flag = 1;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            if (mp[i][j] == 'x' && dis[i][j] > k)
                flag = 0;
    if (flag) cout << "TAK\n";
    else cout << "NIE\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}