#pragma GCC optimize("Ofast,unroll-loops,inline")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
using namespace std;
const int maxN=1e3+5;
const int mod=998244353;
const int base=311;
int n,m,Time,d[maxN*maxN],num[maxN*maxN],out[maxN*maxN],up[maxN*maxN][18];
char a[maxN][maxN];
vector<int> adj[maxN*maxN];
void dfs(ll u,ll p){
    num[u]=++Time;
    up[u][0]=p;
    for(int i=1;i<18;i++)up[u][i]=up[up[u][i-1]][i-1];
    for(auto v:adj[u])if(v!=p)d[v]=d[u]+1,dfs(v,u);
    out[u]=Time;
}
bool is_ancestor(int u, int v){return num[u] <= num[v] && out[u] >= out[v];}
int lca(int u, int v){
    if (is_ancestor(u, v))return u;
    if (is_ancestor(v, u))return v;
    for (int i = 17; i >= 0; --i)
        if (!is_ancestor(up[u][i], v))
            u = up[u][i];
    return up[u][0];
}
int dist(int u,int v){return d[u]+d[v]-2*d[lca(u,v)];}
void Enter(){
    cin>>n>>m;
    for(int i=1;i<=2*n+1;i++)for(int j=1;j<=2*m+1;j++)cin>>a[i][j];
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
        if(a[2*i+1][2*j]=='.'){
            int u=(i-1)*m+j;
            int v=i*m+j;
            adj[u].pb(v);
            adj[v].pb(u);
        }
        if (a[2*i][2*j+1]=='.'){
            int u=(i-1)*m+j;
            int v=(i-1)*m+j+1;
            adj[u].pb(v);
            adj[v].pb(u);
        }
    }
    int last=n*m;
    dfs(last,last);
    int r=0;
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
        if(a[2*i+1][2*j]!='.'&&i<n){
            int u=(i-1)*m+j;
            int v=i*m+j;
            int x=lca(1,u);
            if(x!=last&&!is_ancestor(x,v))r=max(r,d[v]+dist(1,u));
            x=lca(1,v);
            if(x!=last&&!is_ancestor(x,u))r=max(r,d[u]+dist(1,v));
        }
        if(a[2*i][2*j+1]!='.'&&j<m){
            int u=(i-1)*m+j;
            int v=(i-1)*m+j+1;
            int x=lca(1,u);
            if(x!=last&&!is_ancestor(x,v))r=max(r,d[v]+dist(1,u));
            x=lca(1,v);
            if(x!=last&&!is_ancestor(x,u))r=max(r,d[u]+dist(1,v));
        }
    }
    cout<<r+2;
}
//amogus
signed main(){
    //open("tbrackets");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    //int t=1;cin>>t;while(t--)
    Enter();
}