#include <bits/stdc++.h>

using namespace std;

#define int long long
int n, m;
vector<string> v;

bool valid(int i, int j) {
    return i >= 0 && i < n && j >= 0 && j < m && v[i][j] != '#';
}

vector<vector<int>> mem;

int dp(int i, int j) {
    if (!valid(i, j))return 0;
    if (i == n - 1 && j == m - 1)return 1;
    int &res = mem[i][j];
    if (~res)return res;
    res = dp(i, j + 1);
    if (res)return res;
    res = dp(i + 1, j);
    return res;
}

string r, c, p;

void build(int i, int j) {
    if (i == n - 1 && j == m - 1) {
        return;
    }
    if (dp(i, j + 1)) {
        p += 'P';
        int ps = v[i][j + 1] == '@';
        ps ^= r[i] == 'T';
        if (ps)c[j + 1] = 'T';
        build(i, j + 1);
        return;
    }
    if (dp(i + 1, j)) {
        p += 'D';
        int ps = v[i + 1][j] == '@';
        ps ^= c[j] == 'T';
        if (ps)
            r[i + 1] = 'T';
        build(i + 1, j);
        return;
    }
}

void solve() {
    r.clear();
    c.clear();
    p.clear();
    cin >> n >> m;
    mem = vector<vector<int>>(n, vector<int>(m, -1));
    v = vector<string>(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    for (int i = 0; i < n; ++i) {
        r += 'N';
    }
    for (int i = 0; i < m; ++i) {
        c += 'N';
    }
    if (v[0][0] == '@') {
        r[0] = 'T';
    }
    if (dp(0, 0)) {
        build(0, 0);
        cout << "TAK\n";
        cout << r << '\n';
        cout << c << '\n';
        cout << p;
    } else cout << "NIE";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int tc = 1;
    cin >> tc;
    while (tc--) {
        solve();
        if (tc) cout << '\n';
    }
    return 0;
}