#include <bits/stdc++.h>
#define _1 (__int128)1

using namespace std;
using ll = long long;
using pii = pair<int, int>;

void FileIO (const string s) {
  freopen(string(s + ".in").c_str(), "r", stdin);
  freopen(string(s + ".out").c_str(), "w", stdout);
}

const int N = 4010, M = 6010, C = 1e6 + 10;

int T, n, m, id[N][M], cnt, st, en, dis[C];
string s;
char c[N][M];
vector<int> g[C];
queue<int> q;

void Record (int x, int lv) {
  if (dis[x]) return ;
  dis[x] = lv, q.push(x);
}

void Solve () {
  cin >> n >> m, cin.get(), cnt = 0;
  for (int i = 1; i <= 4 * n + 3; i++) {
    getline(cin, s);
    for (int j = 1; j <= 6 * m + 3; j++)
      c[i][j] = (j <= s.size() ? s[j - 1] : ' ');
    //for (int j = 1; j <= 6 * m + 3; j++)
    //  cout << c[i][j];
    //cout << '\n';
  }
  for (int i = 3; i <= 4 * n + 1; i += 2)
    for (int j = (i / 2 % 2 ? 5 : 11); j <= 6 * m + 3; j += 12) {
      id[i][j] = ++cnt;
      if (c[i][j] == 'S') st = cnt;
      else if (c[i][j] == 'T') en = cnt;
    }
  for (int i = 3; i <= 4 * n + 1; i += 2)
    for (int j = (i / 2 % 2 ? 5 : 11); j <= 6 * m + 3; j += 12) {
      if (c[i - 2][j] == ' ') g[id[i][j]].push_back(id[i - 4][j]), g[id[i - 4][j]].push_back(id[i][j]);
      if (c[i - 1][j - 3] == ' ') g[id[i][j]].push_back(id[i - 2][j - 6]), g[id[i - 2][j - 6]].push_back(id[i][j]);
      if (c[i + 1][j - 3] == ' ') g[id[i][j]].push_back(id[i + 2][j - 6]), g[id[i + 2][j - 6]].push_back(id[i][j]);
    }
  Record(st, 1);
  //cout << st << ' ' << en << '\n';
  while (q.size()) {
    int x = q.front();
    q.pop();
    //cout << x << ' ' << dis[x] << '\n';
    for (int i : g[x])
      Record(i, dis[x] + 1);
  }
  cout << dis[en];
  for (int i = 1; i <= cnt; i++)
    g[i] = vector<int> (), dis[i] = 0;
}

signed main () {
  ios::sync_with_stdio(0), cin.tie(0);
  // FileIO("");
  for (cin >> T; T--; Solve(), cout << '\n') {}
  return 0;
}