#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
const int N = 1e3 + 10;
int n, m, k, ai[N][N], tmp[N][N]; int dis[N][N]; 
int fx[4] = {1, -1, 0, 0}, fy[4] = {0, 0, 1, -1}; char s[N];
bool check(int x, int y) {
    return x >= 1 && x <= n && y >= 1 && y <= m;
}
void bfs() {
    queue<pair<int, int> > q;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++) {
            dis[i][j] = -1;
            if(tmp[i][j]) dis[i][j] = 0, q.push(make_pair(i, j));
        }
    while(!q.empty()) {
        int x = q.front().first, y = q.front().second; q.pop();
        if(dis[x][y] == k) continue;
        for(int i = 0; i < 4; i++) {
            int xx = x + fx[i], yy = y + fy[i];
            if(check(xx, yy) && dis[xx][yy] == -1)
                dis[xx][yy] = dis[x][y] + 1, q.push({xx, yy});
        }
    }
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            tmp[i][j] = (dis[i][j] != -1);
}
int main() {
    //file("");
    int T; read(T);
    while(T--) {
        read(n), read(m), read(k);
        for(int i = 1; i <= n; i++) {
            scanf("%s", s + 1);
            for(int j = 1; j <= m; j++)
                ai[i][j] = (s[j] == 'x');
        }
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) tmp[i][j] = ai[i][j] ^ 1;
        bfs();
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) tmp[i][j] ^= 1;
        bfs(); int flag = 1;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) if(tmp[i][j] != ai[i][j]) flag = 0;
        if(flag) puts("TAK");
        else puts("NIE");
    }
    
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}