ecpc(bfs)

// Those who cannot remember the past are
// condemned to repeat it (use DP -_-)
// - George Santayana

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define PI acos(-1)
#define ceil(a, b) (((a) / (b)) + ((a) % (b) ? 1 : 0))
#define imin INT_MIN
#define imax INT_MAX
#define llmax LLONG_MAX
#define llmin LLONG_MIN
#define inf 2000000000
#define nl '\n'
#define ppcnt __builtin_popcount
#define ppcntll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define modulo(a, b, mod) ((((a) % (mod)) + ((b) % (mod))) % (mod))
#define cnte(v, x) count(all(v), (x))
#define mine(v) min_element(all(v))
#define maxe(v) max_element(all(v))
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define findmod(x, m) x = ((x) % (m) + (m)) % m
#define getmod(x, m) ((x) % (m) + (m)) % (m)
#define debug(x) cout << "x: " << (x) << nl;
#define debug2(x, y) cout << "x: " << (x) << " y: " << y << nl;
#define ordered_set tree<pair<int, int>, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_map tree<int, int, less<>, rb_tree_tag, tree_order_statistics_node_update>

//vector<int> dx = {0, 0, 1, -1, 1, 1, -1, -1}, dy = {1, -1, 0, 0, 1, -1, 1, -1};
vector<int> dx = {0, 0, 1, -1}, dy = {1, -1, 0, 0};

template<typename T = int>
istream &operator>>(istream &in, vector<pair<int, int>> &v) {
    for (auto &[x, y]: v) in >> x >> y;
    return in;
}

template<typename T = int>
istream &operator>>(istream &in, vector<T> &v) {
    for (T &i: v) in >> i;
    return in;
}

template<typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v) {
    for (const T &x: v)
        out << x << ' ';
    return out;
}

template<typename T = pair<int, int>>
ostream &operator<<(ostream &out, const vector<pair<int, int>> &v) {
    for (auto &[x, y]: v) {
        out << x << ' ' << y << nl;
    }
    return out;
}

void Start_Crushing() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

char grid[1003][1003];

void solve(){
    int n, m; cin >> n >> m;

    int t_x = -1, t_y = -1, c_x = -1, c_y = -1;

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> grid[i][j];
            if(grid[i][j] == 'C')
                c_x = i, c_y = j;
            else if(grid[i][j] == 'T')
                t_x = i, t_y = j;
        }
    }

    auto valid = [&](int x, int y){
        return x >= 0 and x < n and y >= 0 and y < m and grid[x][y] != '#';
    };

    int nasr, alex; cin >> nasr >> alex;

    vector<vector<int>> ans_a, ans_b;
    ans_a = ans_b = vector<vector<int>>(n, vector<int>(m, imax));
    queue<pair<int, int>> a, b;

    a.push({0, 0}), b.push({n - 1, m - 1});
    ans_a[0][0] = 0, ans_b[n - 1][m - 1] = 0;


    while(not(a.empty())){
        int size = (int)a.size();

        while(size--){
            auto [x, y] = a.front();
            a.pop();

            for(int d = 0; d < 4; d++){
                int new_x = x + dx[d], new_y = y + dy[d];
                if(valid(new_x, new_y)){
                    if(ans_a[new_x][new_y] > ans_a[x][y] + 1){
                        a.push({new_x, new_y});
                        ans_a[new_x][new_y] = ans_a[x][y] + 1;
                    }
                }
            }
        }
    }

    while(not(b.empty())){
        int size = (int)b.size();

        while(size--){
            auto [x, y] = b.front();
            b.pop();

            for(int d = 0; d < 4; d++){
                int new_x = x + dx[d], new_y = y + dy[d];
                if(valid(new_x, new_y)) {
                    if(ans_b[new_x][new_y] > ans_b[x][y] + 1) {
                        b.push({new_x, new_y});
                        ans_b[new_x][new_y] = ans_b[x][y] + 1;
                    }
                }
            }
        }
    }

    if(c_x == -1)
        return void(cout << "Tie");

    int x = min(ans_a[t_x][t_y], ans_a[c_x][c_y]);
    int y = min(ans_b[t_x][t_y], ans_b[c_x][c_y]);

    if(min(x, y) == imax)
        return void(cout << "Tie");

    x = ceil(x, nasr), y = ceil(y, alex);

    cout << (x <= y ? "Nasr" : "Alex");
}

void set_file(string &file_name) {
    freopen((file_name + ".in").c_str(), "r", stdin);
//    freopen((file_name + ".out").c_str(), "w", stdout);
}

int main() {
    Start_Crushing();

//    string file_name = "conan";
//    set_file(file_name);

    int t = 1;
//    /*Multiple test cases?*/ cin >> t;
    while (t--) {
        solve();
        if (!t)
            break;
        cout << nl;
    }

//    for(int tc = 1; tc <= t; tc++){
//        cout << "Case " << tc << ": ";
//        solve();
////        if(tc != t)
//            cout << nl;
//    }

    return 0;
}