#include <bits/stdc++.h>

#define ndl '\n'
#define ll long long
#define INF 1000000007
#define st first
#define nd second
#define debug(x) cout << #x << ": " << x << ndl
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()

using namespace std;

void rob() {
    int n, m, q; cin >> n >> m >> q;
    vector<vector<vector<char>>> t(2, vector<vector<char>>(3 * n, vector<char>(3 * m, '.')));
    for (int i = 0;i < n;i++)
        for (int j = 0;j < m;j++) {
            cin >> t[0][i + n][j + m];
            t[1][i + n][j + m] = t[0][i + n][j + m];
        }

    function<void(bool)> clear = [&](bool parity) {
        for (int i = 0;i < n * 3;i++)
            for (int j = 0;j < m * 3;j++)
                if (t[parity][i][j] == 'B')
                    t[parity][i][j] = '.';
        };

    vector<char> Q(q); for (auto& x : Q) cin >> x;
    map<char, pair<int, int>> dir{ {'N', {-1, 0}}, {'S', {1, 0}}, {'E', {0, 1}}, {'W', {0, -1}} };

    bool parity = 0;
    for (char c : Q) {
        clear(!parity);
        int mini_move = INT_MAX;
        for (int i = 0;i < 3 * n;i++){
            for (int j = 0;j < 3 * m;j++){
                if (t[parity][i][j] == 'B') {
                    for (int k = 1; (i + ((dir[c].st) * k)) >= 0 &&
                                    (i + ((dir[c].st) * k)) < 3 * n &&
                                    (j + ((dir[c].nd) * k)) >= 0 &&
                                    (j + ((dir[c].nd) * k)) < 3 * m;
                        k++
                        ) {
                        if (t[parity][i + dir[c].st * k][j + dir[c].nd * k] == 'A') {
                            mini_move = min(mini_move, k - 1);
                            break;
                        }
                    }
                }
            }
        }
        if (mini_move == INT_MAX) {
            cout << "TAK\n";
            return;
        }

        for (int i = 0;i < 3 * n;i++)
            for (int j = 0;j < 3 * m;j++)
                if (t[parity][i][j] == 'B')
                    t[!parity][i + dir[c].st * mini_move][j + dir[c].nd * mini_move] = 'B';

        parity = !parity;
    }
    cout << "NIE\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t;
    cin >> t;
    for (int i = 0;i < t;i++)
        rob();
}