/// Brrrr Brrrr
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 2e5+5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};

int n, m, k;
char grid[1005][1005];
vector<vector<int>> BFS(vector<ii> sources) {

    vector<vector<int>> dist(n + 1, vector<int>(m + 1, -1));

    queue<ii> q;
    for(auto & p : sources) {
        dist[p.first][p.second] = 0;
        q.push(p);
    }

    while(q.size()) {

        int x, y;
        tie(x,y) = q.front();
        q.pop();

        f(k,0,4) {
            int nx = x + dx[k];
            int ny = y + dy[k];
            if(nx >= 1 && ny >= 1 && nx <= n && ny <= m) {
                if(dist[nx][ny] == -1) {
                    q.push({nx,ny});
                    dist[nx][ny] = dist[x][y] + 1;
                }
            }
        }

    }


    return dist;
}
void doWork() {

    cin >> n >> m >> k;

    vector<ii> dots;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> grid[i][j];
            if(grid[i][j] == '.')
            dots.push_back({i,j});
        }
    }

    auto dist = BFS(dots);

    vector<ii> hashes;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(dist[i][j] > k || dist[i][j] == -1) {
                hashes.push_back({i,j});
            }
        }
    }


    dist = BFS(hashes);

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) if(grid[i][j] == 'x'){
            if(dist[i][j] > k || dist[i][j] == -1) {
                cout << "NIE\n";
                return;
            }
        }
    }

    cout << "TAK\n";

}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}

///Look at my code ya codeomk