#include<bits/stdc++.h>

using namespace std;

const int N=;

int n,m,ans,f1[N][N],f2[N][N],f3[N][N],f4[N][N];

char mp[N][N];

int main()

{

    scanf("%d%d",&n,&m);

    for(int i=;i<=n;i++)scanf("%s",mp[i]+);

    for(int i=;i<=n;i++)

    for(int j=;j<=m;j++)

    if(mp[i][j]=='.')f1[i][j]=f1[i-][j]+,f2[i][j]=f2[i][j-]+;

    for(int i=n;i;i--)

    for(int j=m;j;j--)

    if(mp[i][j]=='.')f3[i][j]=f3[i+][j]+,f4[i][j]=f4[i][j+]+;

    for(int i=;i<=n;i++)

    for(int j=;j<=m;j++)

    if(mp[i][j]=='.')ans=max(ans,f1[i][j]+f2[i][j]+f3[i][j]+f4[i][j]-);

    printf("%d\n",ans);

}

#include<bits/stdc++.h>

using namespace std;

const int N=1e5+,mod=1e9+;

int n,ans,f[N][];

char s[N];

int main()

{

    scanf("%s",s+);

    n=strlen(s+);

    f[][]=;

    for(int i=;i<=n;i++)

    if(s[i]=='')f[i][]=(3ll*f[i-][]+f[i-][])%mod,f[i][]=2ll*f[i-][]%mod;

    else f[i][]=3ll*f[i-][]%mod,f[i][]=f[i-][];

    ans=(f[n][]+f[n][])%mod;

    printf("%d",ans);

}

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

ll L,st,ed,b,pw[];

int m,ans;

struct mat{

    int a[][];

    mat(){memset(a,,sizeof a);}

    void init(int i)

    {

        memset(a,,sizeof a);

        a[][]=pw[i]%m,a[][]=a[][]=a[][]=a[][]=;

    }

}A,ret;

mat operator*(mat a,mat b)

{

    mat c;

    for(int i=;i<;i++)

    for(int j=;j<;j++)

    for(int k=;k<;k++)

    c.a[i][j]=(c.a[i][j]+1ll*a.a[i][k]*b.a[k][j])%m;

    return c;

}

int solve(ll L,ll R,int id)

{

    ll n=(R-L)/b+;

    for(int i=;i<;i++)for(int j=;j<;j++)ret.a[i][j]=i==j;

    A.init(id);

    while(n)

    {

        if(n&)ret=ret*A;

        A=A*A,n>>=;

    }

    ans=(1ll*ans*ret.a[][]+L%m*ret.a[][]+b%m*ret.a[][])%m;

}

int main()

{

    pw[]=;for(int i=;i<=;i++)pw[i]=pw[i-]*;

    cin>>L>>st>>b>>m;

    ed=st+b*(L-);

    for(int i=;i<=;i++)

    if(st<pw[i])

    {

        ll R=(pw[i]--st)/b*b+st;

        if(R>ed)R=ed;

        solve(st,R,i);

        if(R==ed)break;

        st=R+b;

    }

    cout<<ans<<endl;

}