//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder; //https://github.com/atcoder/ac-library

#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define bit(n, k) ((n >> k) & 1)
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> pii;

int ans;

void solve(int n, int m, vector<string> &g){
    vector<vector<int>> u(n,vector<int>(m,0)),d(n,vector<int>(m,0)),l(n,vector<int>(m,0)),r(n,vector<int>(m,0));
    rep(i,0,n)rep(j,0,m){
        if(g[i][j]=='#')continue;
        u[i][j]=1;
        l[i][j]=1;
        if(i-1>=0)u[i][j]+=u[i-1][j];
        if(j-1>=0)l[i][j]+=l[i][j-1];
        ans=max(ans,u[i][j]);
        ans=max(ans,l[i][j]);
    }
    for(int i=n-1; i>=0; i--)for(int j=m-1; j>=0; j--){
        if(g[i][j]=='#')continue;
        d[i][j]=1;
        r[i][j]=1;
        if(i+1<n)d[i][j]+=d[i+1][j];
        if(j+1<m)r[i][j]+=r[i][j+1];
        ans=max(ans,d[i][j]);
        ans=max(ans,r[i][j]);
    }
    // 같은 가로
    rep(i,0,n){
        int ps_mx=0;
        vector<int> suf(m);
        for(int j=m-1; j>=0; j--){
            suf[j]=r[i][j];
            if(j+1<m)suf[j]=max(suf[j],suf[j+1]);
        }
        rep(j,0,m-1){
            ps_mx=max(ps_mx,l[i][j]);
            ans=max(ans,ps_mx+suf[j+1]);
        }
    }
    // 가로+ 위아래 최대
    vector<int> d_suf(n), lr_suf(n);
    for(int i=n-1; i>=0; i--){
        int t1=0,t2=0;
        rep(j,0,m){
            t1=max(t1,d[i][j]);
            t2=max(t2,max(l[i][j],r[i][j]));
        }
        d_suf[i]=t1;
        lr_suf[i]=t2;
        if(i+1<n){
            d_suf[i]=max(d_suf[i],d_suf[i+1]);
            lr_suf[i]=max(lr_suf[i],lr_suf[i+1]);
        }
    }
    int u_ps_mx=0, lr_ps_mx=0;
    rep(i,0,n){
        int t1=0,t2=0;
        rep(j,0,m){
            int now=max(l[i][j],r[i][j]);
            int up=max(u_ps_mx,lr_ps_mx);
            int down=0;
            if(i+1<n){
                down=max(d_suf[i+1],lr_suf[i+1]);
            }
            int add=max(up,down);
            ans=max(ans,now+add);
            t1=max(t1,u[i][j]);
            t2=max(t2,max(l[i][j],r[i][j]));
        }
        u_ps_mx=max(u_ps_mx,t1);
        lr_ps_mx=max(lr_ps_mx,t2);
    }
}

void test_case(int tt){
    int n,m; cin>>n>>m;
    vector<string> g(n);
    rep(i,0,n)cin>>g[i];
    ans=0;
    solve(n,m,g);
    vector<string> g1(m);
    rep(j,0,m){
        string s;
        rep(i,0,n)s+=g[i][j];
        g1[j]=s;
    }
    solve(m,n,g1);
    cout<<ans<<'\n';
    return;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    cin>>t;
    rep(i, 1, t + 1)
    {
        test_case(i);
    }
    return 0;
}