#include <bits/stdc++.h>
using namespace std;
using namespace std;
using ll=long long;
#define all(x) (x).begin(), (x).end()

int cal_row(string s)
{
    int r=0, tmp=0;
    for(int j=1;j<s.size();++j) 
    {
        if(s[j]=='#') r=max(r, tmp), tmp=0;
        else ++tmp, r=max(r, tmp);
    }
    return r;
}

int cal1(vector<string> a, int n, int m)
{
    vector<int> num;
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=m;++j)if(a[i][j]=='.')
        {
            int r=j;
            while(r+1<=m&&a[i][r+1]=='.') ++r;
            num.push_back(r-j+1);
            j=r;
        }
    }
    sort(all(num)); reverse(all(num));
    
    // for(auto x : num) cerr<<x<<" ";cerr<<"\n";
    
    int sum=0;
    for(int i=0; i<=1 && i<num.size(); ++i) sum+=num[i];
    return sum;
}

int cal2(vector<string> a, int n, int m)
{
    vector pre(n+2, vector<int>(m+2)), suf=pre;
    for(int j=1;j<=m;++j)
    {
        int tmp=0;
        for(int i=1;i<=n;++i)
        {
            pre[i][j]=pre[i-1][j];
            if(a[i][j]=='.') ++tmp, pre[i][j]=max(pre[i][j], tmp);
            else tmp=0;
        }
    }
    
    for(int j=1;j<=m;++j)
    {
        int tmp=0;
        for(int i=n;i;--i)
        {
            if(i<n) suf[i][j]=suf[i+1][j];
            if(a[i][j]=='.') ++tmp, suf[i][j]=max(suf[i][j], tmp);
            else tmp=0;
        }
    }
    
    for(int j=1;j<=m;++j) for(int i=1;i<=n;++i) pre[i][j]=max(pre[i][j], pre[i][j-1]);
    for(int j=m-1; j; --j) for(int i=1;i<=n;++i) suf[i][j]=max(suf[i][j], suf[i][j+1]);
    
    int sum=0;
    
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=m;++j) if(a[i][j]=='.')
        {
            int r=j;
            while(r+1<=m && a[i][r+1]=='.') ++r;
            
            sum=max(sum, r-j+1+max({pre[i-1][m], pre[n][j-1], suf[i+1][1], suf[1][r+1]}));
            
            j=r;
        }
        
    }
    
    return sum;
}

void solve()
{
    int n, m;
    cin>>n>>m;
    vector<string> s(n+1);
    for(int i=1;i<=n;++i) cin>>s[i], s[i]=" "+s[i];
    
    vector<string> t(m+1, string(n+1, ' '));
    for(int j=1;j<=m;++j) for(int i=1;i<=n;++i) t[j][i]=s[i][j];
    
    cout << max({cal1(s, n, m), cal1(t, m, n), cal2(s, n, m), cal2(t, m, n)}) << "\n";
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    
    int T;
    cin>>T;
    while(T--) solve();
}