#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define debug(x) cout << #x << ":" << x << endl
#define INF 0x7fffffff
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;

vector<vector<char>> mp;
vector<vector<int>> dpl,dpr,dpu,dpd;
vector<vector<int>> ml,mr,mu,md;
int n,m;
signed main(){
    IOS;
    int T;cin>>T;
    while(T--){
        cin>>n>>m;
        mp.clear();
        dpl.clear(),dpr.clear(),dpu.clear(),dpd.clear();
        ml.clear(),mr.clear(),mu.clear(),md.clear();
        mp.resize(n+2),dpl.resize(n+2),dpr.resize(n+2),dpu.resize(n+2),dpd.resize(n+2);
        ml.resize(n+2),mr.resize(n+2),mu.resize(n+2),md.resize(n+2);
        rep(i,0,n+1) mp[i].resize(m+2,0),dpl[i].resize(m+2,0),dpr[i].resize(m+2,0),dpu[i].resize(m+2,0),dpd[i].resize(m+2,0);
        rep(i,0,n+1) ml[i].resize(m+2,0),mr[i].resize(m+2,0),mu[i].resize(m+2,0),md[i].resize(m+2,0);
        rep(i,1,n)
            rep(j,1,m)
                cin>>mp[i][j];
        int l1=0,l2=0,r1=0,r2=0;
        rep(i,1,n){
            int l=0;
            rep(j,1,m){
                dpr[i][j]=((mp[i][j-1]=='#')?1:dpr[i][j-1]+1);
                if(mp[i][j]=='#') dpr[i][j]=0;
                l=max(l,dpr[i][j]);
                if(j>1) ml[i][j]=max(ml[i][j-1],dpr[i][j-1]); 
            }
            if(l>l1) l2=l1,l1=l;
            else if(l>l2) l2=l;
        }
        rrep(i,n,1){
            rrep(j,m,1){
                dpl[i][j]=((mp[i][j+1]=='#')?1:dpl[i][j+1]+1);
                if(mp[i][j]=='#') dpl[i][j]=0;
                if(j<m) mr[i][j]=max(mr[i][j+1],dpl[i][j+1]); 
            }
        }
        rep(j,1,m){
            int r=0;
            rep(i,1,n){
                dpd[i][j]=((mp[i-1][j]=='#')?1:dpd[i-1][j]+1);
                if(mp[i][j]=='#') dpd[i][j]=0;
                r=max(r,dpd[i][j]);
                if(i>1) mu[i][j]=max(mu[i-1][j],dpd[i-1][j]);
            }
            if(r>r1) r2=r1,r1=r;
            else if(r>r2) r2=r;
        }
        rrep(j,m,1){
            rrep(i,n,1){
                dpu[i][j]=((mp[i+1][j]=='#')?1:dpu[i+1][j]+1);
                if(mp[i][j]=='#') dpu[i][j]=0;
                if(i<n) md[i][j]=max(md[i+1][j],dpu[i+1][j]);
            }
        }
        // rep(i,1,n){
        //     rep(j,1,m){
        //         cout<<dpu[i][j]<<" ";
        //     }
        //     cout<<'\n';
        // }
        int ans=max(l1+l2,r1+r2);
        rep(i,1,n){
            rep(j,1,m){
                //if(mp[i][j]=='#') continue;
                int a,b,t1,t2,t3,t4,t5,t6;
                t1=ml[i][j]+mr[i][j];
                t2=ml[i][j]+mu[i][j];
                t3=ml[i][j]+md[i][j];
                t4=mr[i][j]+mu[i][j];
                t5=mr[i][j]+md[i][j];
                t6=mu[i][j]+md[i][j];
                if(ml[i][j]==dpr[i][j]-1||mr[i][j]==dpl[i][j]-1) t1++;
                if(ml[i][j]==dpr[i][j]-1||mu[i][j]==dpd[i][j]-1) t2++;
                if(ml[i][j]==dpr[i][j]-1||md[i][j]==dpu[i][j]-1) t3++;
                if(mr[i][j]==dpl[i][j]-1||mu[i][j]==dpd[i][j]-1) t4++;
                if(mr[i][j]==dpl[i][j]-1||md[i][j]==dpu[i][j]-1) t5++;
                if(md[i][j]==dpu[i][j]-1||mu[i][j]==dpd[i][j]-1) t6++;
                a=dpr[i][j]+dpl[i][j]-1+max(dpu[i][j],dpd[i][j])-1;
                b=dpu[i][j]+dpd[i][j]-1+max(dpr[i][j],dpl[i][j])-1;
                if(mu[i][j]>dpd[i][j]-1) a=max(a,dpr[i][j]+dpl[i][j]-1+mu[i][j]);
                if(md[i][j]>dpu[i][j]-1) a=max(a,dpr[i][j]+dpl[i][j]-1+md[i][j]);
                if(ml[i][j]>dpr[i][j]-1) b=max(b,dpu[i][j]+dpd[i][j]-1+ml[i][j]);
                if(mr[i][j]>dpl[i][j]-1) b=max(b,dpu[i][j]+dpd[i][j]-1+mr[i][j]);
                // debug(a);
                // debug(b);
                int t=max(max(max(t1,t2),max(t3,t4)),max(t5,t6));
                ans=max(max(a,b),max(ans,t));
            }
        }
        cout<<ans<<'\n';
    }
    return 0;
}