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

void solve() {
    int r, c;
    scanf("%d %d", &r, &c); getchar();
    vector<vector<char>> a(4*r+3, vector<char>(6*c+3));
    for (int i = 0; i < 4*r+3; i++) {
        for (int j = 0; j <= 6*c+3; j++) {
            char c = getchar();
            if (c == '\n') break;
            a[i][j] = c;
        }
    }

    // for (auto &row: a) {
    //     for (auto c: row) cout << c;
    //     cout << endl;
    // }

    auto id = [](int i, int j) {
        return i*10000+j;
    };

    int s, t;
    map<int, set<int>> g;
    auto addedge = [&](int u, int v) {
        g[u].emplace(v);
        g[v].emplace(u);
    };

    for (int i = 2; i < 4*r+2; i += 4) {
        for (int j = 4; j < 6*c+3; j += 12) {
            // cout << i << ' ' << j << endl;
            int x = i, y = j;
            int u = id(i, j);
            if (a[x][y] == 'S') s = u;
            else if (a[x][y] == 'T') t = u;
            else if (a[x][y] != ' ') continue;
            if (a[x-2][y] == ' ') addedge(u, id(i-4, j));
            if (a[x-1][y-3] == ' ') addedge(u, id(i-2, j-6));
            if (a[x+1][y-3] == ' ') addedge(u, id(i+2, j-6));
            if (a[x+2][y] == ' ') addedge(u, id(i+4, j));
            if (a[x+1][y+3] == ' ') addedge(u, id(i+2, j+6));
            if (a[x-1][y+3] == ' ') addedge(u, id(i-2, j+6));
        }
    }
    for (int i = 4; i < 4*r+2; i += 4) {
        for (int j = 10; j < 6*c+3; j += 12) {
            // cout << i << ' ' << j << endl;
            int x = i, y = j;
            int u = id(i, j);
            if (a[x][y] == 'S') s = u;
            else if (a[x][y] == 'T') t = u;
            else if (a[x][y] != ' ') continue;
            if (a[x-2][y] == ' ') addedge(u, id(i-4, j));
            if (a[x-1][y-3] == ' ') addedge(u, id(i-2, j-6));
            if (a[x+1][y-3] == ' ') addedge(u, id(i+2, j-6));
            if (a[x+2][y] == ' ') addedge(u, id(i+4, j));
            if (a[x+1][y+3] == ' ') addedge(u, id(i+2, j+6));
            if (a[x-1][y+3] == ' ') addedge(u, id(i-2, j+6));
        }
    }

    // cout << s << ' ' << t << endl;
    // for (auto &[u, adj]: g) {
    //     cout << u << ' ';
    //     for (auto v: adj) cout << ' ' << v;
    //     cout << endl;
    // }

    map<int, int> dist; dist[s] = 0;
    queue<int> q; q.push(s);
    set<int> vis; vis.emplace(s);
    while (q.size()) {
        int u = q.front(); q.pop();
        for (auto v: g[u]) {
            if (vis.count(v)) continue;
            dist[v] = dist[u]+1;
            if (v == t) break;
            q.push(v);
            vis.emplace(v);
        }
    }

    printf("%d\n", (dist.count(t) ? dist[t]+1 : -1));
}

int main() {
    int t;
    scanf("%d", &t);
    for (; t; t--) solve();
    return 0;
}