// I stand with PALESTINE
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
// #define int long long
#define ff first
#define ss second
#define sz(a) (int) (a).size()
//template<class T, class C = null_type> using ordered_tree = tree<T, C, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long double ld;
namespace io {
template<typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << p.ff << " " << p.ss; }
template<typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &mp) {
for (auto it: mp) { os << it << endl; }
return os;
}
template<typename F>
ostream &operator<<(ostream &os, const vector<F> &v) {
bool space = false;
for (F x: v) {
if (space) os << " ";
space = true;
os << x;
}
return os;
}
template<typename F>
ostream &operator<<(ostream &os, const deque<F> &d) {
bool space = false;
for (F x: d) {
if (space) os << " ";
space = true;
os << x;
}
return os;
}
template<typename F>
ostream &operator<<(ostream &os, const set<F> &st) {
bool space = false;
for (F x: st) {
if (space) os << " ";
space = true;
os << x;
}
return os;
}
template<typename F>
ostream &operator<<(ostream &os, const multiset<F> &st) {
bool space = false;
for (F x: st) {
if (space) os << " ";
space = true;
os << x << x;
}
return os;
}
template<typename F, typename S>
istream &operator>>(istream &is, pair<F, S> &p) { return is >> p.ff >> p.ss; }
template<typename F>
istream &operator>>(istream &is, vector<F> &v) {
for (F &x: v) { is >> x; }
return is;
}
long long fastread() {
char c;
long long d = 1, x = 0;
do c = getchar(); while (c == ' ' || c == '\n');
if (c == '-') c = getchar(), d = -1;
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return d * x;
}
static bool sep = false;
using std::to_string;
string to_string(bool x) {
return (x ? "true" : "false");
}
string to_string(const string &s) { return "\"" + s + "\""; }
string to_string(const char *s) { return "\"" + string(s) + "\""; }
string to_string(const char &c) {
string s;
s += c;
return "\'" + s + "\'";
}
template<typename Type>
string to_string(vector<Type>);
template<typename F, typename S>
string to_string(pair<F, S>);
template<typename Collection>
string to_string(Collection);
template<typename F, typename S>
string to_string(pair<F, S> p) { return "{" + to_string(p.ff) + ", " + to_string(p.ss) + "}"; }
template<typename Type>
string to_string(vector<Type> v) {
bool sep = false;
string s = "[";
for (Type x: v) {
if (sep) s += ", ";
sep = true;
s += to_string(x);
}
s += "]";
return s;
}
template<typename Collection>
string to_string(Collection collection) {
bool sep = false;
string s = "{";
for (auto x: collection) {
if (sep) s += ", ";
sep = true;
s += to_string(x);
}
s += "}";
return s;
}
void print() {
cout << endl;
sep = false;
}
template<typename F, typename... Other>
void print(F ff, Other... other) {
if (sep) cout << " | ";
sep = true;
cout << to_string(ff);
print(other...);
}
}
using namespace io;
namespace utils {
template<typename F, typename S>
inline void maxs(F &a, S b) { a = a > b ? a : b; }
template<typename F, typename S>
inline void mins(F &a, S b) { a = a < b ? a : b; }
template<typename F, typename S>
long long max(F a, S b) { return a > b ? a : b; }
template<typename F, typename S>
long long min(F a, S b) { return a < b ? a : b; }
constexpr long long operator "" _E(unsigned long long n) {
long long p = 1, a = 10;
for (int i = 0; i < n; i++) p *= a;
return p;
}
random_device rd;
mt19937 mt(rd());
template<typename T>
T rand(T l, T r) {
uniform_int_distribution<T> dist(l, r);
return dist(mt);
};
}
using namespace utils;
#ifdef sunnatov
#define print(...) cout << "[" << #__VA_ARGS__ << "]: "; io::print( __VA_ARGS__ );
#else
#define print( ... ) 42
#endif
const int mod = 9_E + 7;
const double EPS = 1e-7;
long long doxuya = 18_E + 10;
int INF = 9_E + 10;
const char nl = '\n';
int month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
/*
*/
void solution(istream &cin, ostream &cout, const int &test_case) {
int n, m;
cin >> n >> m;
vector<vector<char>> a(n + 2, vector<char>(m + 2, '#'));
vector up(n + 2, vector(m + 2, make_pair(0, 0)));
vector down(n + 2, vector(m + 2, make_pair(0, 0)));
vector right(n + 2, vector(m + 2, make_pair(0, 0)));
vector left(n + 2, vector(m + 2, make_pair(0, 0)));
pair<int, int> s, e;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
up[i][j] = left[i][j] = make_pair(i, j);
if (a[i - 1][j] != '#') up[i][j] = up[i - 1][j];
if (a[i][j - 1] != '#') left[i][j] = left[i][j - 1];
if (a[i][j] == 'S') s = make_pair(i, j);
if (a[i][j] == 'C') e = make_pair(i, j);
}
}
for (int i = n; i > 0; i--) {
for (int j = m; j > 0; j--) {
down[i][j] = right[i][j] = make_pair(i, j);
if (a[i + 1][j] != '#') down[i][j] = down[i + 1][j];
if (a[i][j + 1] != '#') right[i][j] = right[i][j + 1];
}
}
vector dist(n + 2, vector(m + 2, INF));
vector dist2(n + 2, vector(m + 2, INF));
vector vis(n + 2, vector(m + 2, false));
vector vis2(n + 2, vector(m + 2, false));
priority_queue<tuple<int, int, int>> q;
vector<int> dx = {-1, 1, 0, 0};
vector<int> dy = {0, 0, -1, 1};
auto add = [&](int d, int i, int j, int t) -> void {
if (t == 1) {
if (dist[i][j] <= d) return;
dist[i][j] = d;
q.emplace(-d, i, j);
} else {
if (dist2[i][j] <= d) return;
dist2[i][j] = d;
q.emplace(-d, i, j);
}
};
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
bool ex = false;
for (int k = 0; k < 4; k++) {
ex |= a[i + dx[k]][j + dy[k]] == '#';
}
if (ex) add(0, i, j, 1);
}
}
while (!q.empty()) {
auto [d, i, j] = q.top(); q.pop();
d = -d;
if (vis[i][j]) continue;
vis[i][j] = true;
for (int k = 0; k < 4; k++) {
auto [ii, jj] = make_pair(i + dx[k], j + dy[k]);
if (min(ii, jj) < 1 or ii > n or jj > m) continue;
if (a[ii][jj] == '#') continue;
add(d + 1, ii, jj, 1);
}
}
q.emplace(0, s.ff, s.ss); dist2[s.ff][s.ss] = 0;
while (!q.empty()) {
auto [d, i, j] = q.top(); q.pop();
d = -d;
if (vis2[i][j]) continue;
vis2[i][j] = true;
if (make_pair(i, j) == e) {
cout << d;
return;
}
for (int k = 0; k < 4; k++) {
auto [ii, jj] = make_pair(i + dx[k], j + dy[k]);
if (min(ii, jj) < 1 or ii > n or jj > m) continue;
if (a[ii][jj] == '#') continue;
add(d + 1, ii, jj, 2);
}
vector<pair<int, int>> comb = {up[i][j], down[i][j], left[i][j], right[i][j]};
for (auto [ii, jj]: comb) add(d + dist[i][j] + 1, ii, jj, 2);
}
assert(false);
}
int32_t main() {
clock_t startTime = clock();
cin.tie(0)->sync_with_stdio(false);
srand(time(0));
std::istream &in(std::cin);
std::ostream &out(std::cout);
int32_t queries = 1;
#ifdef test_cases
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
cin >> queries;
#else
// cin >> queries;
#endif
for (int32_t test_case = 1; test_case <= queries; test_case++) {
print(test_case);
solution(cin, cout, test_case);
cout << nl;
}
#ifdef sunnatov
cout << "Time: " << (int) ((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif
return EXIT_SUCCESS;
}
