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

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double


const int N = 2000 + 5, mod = 998244353;

int n, m;
char grid[N][N];
bool t_rows[N], t_cols[N];
string path;

bool dfs(int r, int c) {
    if (r == n - 1 && c == m - 1) {
        return true;
    }
    if (r + 1 < n && grid[r + 1][c] != '#') {
        if (dfs(r + 1, c)) {
            path += 'D';
            return true;
        }
    }
    if (c + 1 < m && grid[r][c + 1] != '#') {
        if (dfs(r, c + 1)) {
            path += 'P';
            return true;
        }
    }
    return false;
}

void build(int r, int c, int t_r, int t_c, int idx) {
    if (idx == path.size()) {
        return;
    }
    if (path[idx] == 'P') {
        auto n_t_c = t_cols[c + 1] = t_r ^ (grid[r][c + 1] == '@');
        build(r, c + 1, t_r, n_t_c, idx + 1);
    } else {
        auto n_t_r = t_rows[r + 1] = t_c ^ (grid[r + 1][c] == '@');
        build(r + 1, c, n_t_r, t_c, idx + 1);
    }
}

void init() {
    path.clear();
    memset(t_rows, 0, sizeof (t_rows));
    memset(t_cols, 0, sizeof (t_cols));
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int z;
    cin >> z;
    while (z--) {
        init();
        cin >> n >> m;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cin >> grid[i][j];
            }
        }
        if (dfs(0, 0)) {
            reverse(path.begin(), path.end());
            if (grid[0][0] == '@') {
                t_rows[0] = 1;
            }
            build(0, 0, grid[0][0] == '@', 0, 0);
            cout << "TAK\n";
            for (int i = 0; i < n; ++i) {
                cout << (t_rows[i] ? 'T' : 'N');
            }
            cout << '\n';
            for (int i = 0; i < m; ++i) {
                cout << (t_cols[i] ? 'T' : 'N');
            }
            cout << '\n';
            cout << path << '\n';
        } else {
            cout << "NIE\n";
        }
    }
    return 0;
}