#include <bits/stdc++.h>
using namespace std;
void solve()
{
/// JUST KEEP GOING
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0};
int n, m; cin>>n>>m; char grid[n][m]; int d[n][m];
int sx, sy; int ex, ey;
for(int l=0;l<n;l++) {
for(int i=0;i<m;i++) {
cin>>grid[l][i]; d[l][i]=1000000000;
if(grid[l][i]=='S') {
sx=l; sy=i; d[sx][sy]=0;
}
else if(grid[l][i]=='C') {
ex=l; ey=i;
}
}
}
queue<pair<int, pair<int, int>>>pq; pq.push({0, {sx, sy}});
while(!pq.empty()) {
int a=pq.front().second.first, b=pq.front().second.second, w=pq.front().first; pq.pop();
if(w>d[a][b]) continue;
if(a==ex&&b==ey) { cout<<w<<'\n'; return; }
for(int l=0;l<4;l++) {
int x=a+nx[l], y=b+ny[l];
if(x>=0&&x<n&&y>=0&&y<m) {
if(grid[x][y]=='#'||d[x][y]<d[a][b]+1) continue;
d[x][y]=d[a][b]+1; pq.push({d[x][y], {x, y}});
}
}
int p=1000000000; vector<pair<int, int>>to;
for(int l=0;l<4;l++) {
int x=a, y=b; int k=0;
while(x>=0&&y>=0&&x<n&&y<m&&grid[x][y]!='#') {
x+=nx[l], y+=ny[l]; k++;
}
x-=nx[l], y-=ny[l];
p=min(p, k); to.push_back({x, y});
}
for(auto u:to) {
int x=u.first, y=u.second;
if(d[x][y]>d[a][b]+p) {
d[x][y]=d[a][b]+p; pq.push({d[x][y], {x, y}});
}
}
}
}
int32_t main()
{
int t; t=1;
while(t--) {
solve();
}
return 0;
}
