#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

string mp[1005];
vector<int> G[250005];
int dx[2] = {1, 0}, dy[2] = {0, 1};
int pa[250005], tag[250005], bln[250005];

void dfs(int u, int f) {
    pa[u] = f;
    for (int i : G[u])
        if (i != f)
            dfs(i, u);
}

void dfs2(int u, int f, int p) {
    bln[u] = p;
    for (int i : G[u])
        if (i != f && !tag[i])
            dfs2(i, u, p);
}

void dfs3(int u, int f, int d, int *dis) {
    dis[u] = d;
    for (int i : G[u])
        if (i != f)
            dfs3(i, u, d + 1, dis);
}

int dis[2][250005];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < 2 * n + 1; ++i)
        cin >> mp[i];

    auto add_edge = [&](int x1, int y1, int x2, int y2) {
        x1 /= 2, y1 /= 2, x2 /= 2, y2 /= 2;
        int u = x1 * m + y1;
        int v = x2 * m + y2;
        G[u].pb(v);
        G[v].pb(u);
    };

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j) {
            int x = 2 * i + 1, y = 2 * j + 1;
            for (int d = 0; d < 2; ++d)
                if (mp[x + dx[d]][y + dy[d]] == '.')
                    add_edge(x, y, x + dx[d] * 2, y + dy[d] * 2);
        }

    int t = (n - 1) * m + m - 1;
    dfs(0, -1);
    vector<int> stk;
    for (int x = t; x != -1; x = pa[x])
        stk.pb(x), tag[x] = 1;
    for (int i : stk)
        dfs2(i, i, i);
    dfs3(0, 0, 1, dis[0]), dfs3(t, t, 1, dis[1]);

    int ans = dis[0][t];
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j) {
            int x = 2 * i + 1, y = 2 * j + 1;
            for (int d = 0; d < 2; ++d)
                if (x + dx[d] + dx[d] < 2 * n + 1 && y + dy[d] + dy[d] < 2 * m + 1 && mp[x + dx[d]][y + dy[d]] != '.') {
                    int u = i * m + j;
                    int v = ((x + dx[d] * 2) / 2) * m + ((y + dy[d] * 2) / 2);
                    if (bln[u] == bln[v]) continue;
                    if (dis[0][bln[u]] < dis[0][bln[v]]) ans = max(ans, dis[0][u] + dis[1][v]);
                    else ans = max(ans, dis[1][u] + dis[0][v]);
                }
        }

    cout << ans << "\n";
}