#include <bits/stdc++.h>
using namespace std;
const int dx[6] = {-1, 1, -1, 1, 2, -2};
const int dy[6] = {-3, 3, 3, -3, 0, 0};
void solve() {
    int n, m;
    cin >> n >> m;
    n = n * 4 + 3;
    m = m * 6 + 3;
    vector<string> a(n);
    getline(cin, a[0]);
    int sx, sy;
    for (int i = 0; i < n; ++i) {
        getline(cin, a[i]);
        for (int j = 0; j < m; j++)
            if (a[i][j] == 'S')
                sx = i, sy = j;
    }
    auto bfs = [&](auto self) -> int {
        queue<tuple<int, int, int>> Q;
        Q.push({sx, sy, 1});
        a[sx][sy] = '*';
        while (!Q.empty()) {
            int x, y, d;
            tie(x, y, d) = Q.front();
            Q.pop();
            for (int o = 0; o < 6; o++) {
                int cx = x + dx[o], nx = cx + dx[o];
                int cy = y + dy[o], ny = cy + dy[o];
                if (nx < 0 || ny < 0 || nx >= n || ny >= m || a[cx][cy] != ' ' || a[nx][ny] == '*')
                    continue;
                if (a[nx][ny] == 'T')
                    return d + 1;
                a[nx][ny] = '*';
                Q.push({nx, ny, d + 1});
            }
        }
        return -1;
    };
    cout << bfs(bfs) << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}