#include <bits/stdc++.h>

using namespace std;

const int N = 70;

int a[N][N], b[N][N];

int nxt(int dx, int dy)
{
    memset(b, 0, sizeof(b));
    int flag = 1;
    for (int i = 5; i <= 65; ++i) {
        for (int j = 5; j <= 65; ++j) {
            if (a[i][j] == 2 && a[i + dx][j + dy] != 1) {
                b[i + dx][j + dy] = 2;
            }
            flag &= (a[i][j] != 2 || a[i + dx][j + dy] != 1);
            if (a[i][j] == 1) {
                b[i][j] = 1;
            }
        }
    }
    if (!flag) {
        return 0;
    }
    memcpy(a, b, sizeof(a));
    return 1;
}

signed main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m, q;
        scanf("%d%d%d", &n, &m, &q);
        memset(a, 0, sizeof(a));
        for (int i = 31; i <= 30 + n; ++i) {
            string s;
            cin >> s;
            for (int j = 31; j <= 30 + m; ++j) {
                a[i][j] = (s[j - 31] == '.' ? 0 : (s[j - 31] == 'A' ? 1 : 2));
            }
        }
        string s;
        cin >> s;
        for (int i = 0; i < q; ++i) {
            int z = 0;
            if (s[i] == 'N') {
                while (nxt(-1, 0) && z <= 11) {
                    ++z;
                }
            } else if (s[i] == 'S') {
                while (nxt(1, 0) && z <= 11) {
                    ++z;
                }
            } else if (s[i] == 'W') {
                while (nxt(0, -1) && z <= 11) {
                    ++z;
                }
            } else {
                while (nxt(0, 1) && z <= 11) {
                    ++z;
                }
            }
            if (z >= 11) {
                puts("TAK");
                break;
            }
            if (i == q - 1) {
                puts("NIE");
            }
        }
    }
    return 0;
}