#include<bits/stdc++.h>
using namespace std;
int n,m;
vector<char>a[1001001];
vector<int>g[1001001],f[1001001],ff[1001001],gg[1001001];
int sf[1001001],sg[1001001],pf[1001001],pg[1001001];
void solve(){
	cin>>n>>m;
	for (int i=0;i<=n+1;i++)
	a[i].resize(m+3),f[i].resize(m+3),ff[i].resize(m+3);
	for (int i=0;i<=n+1;i++)
	g[i].resize(m+3),gg[i].resize(m+3);
	for (int i=0;i<=n+1;i++)
	for (int j=0;j<=m+1;j++)
	f[i][j]=ff[i][j]=g[i][j]=gg[i][j]=0;
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
	cin>>a[i][j];
	int mx=0,ans=0;
	for (int i=1;i<=n;i++){
		int pre=0,pp=0;
		for (int j=1;j<=m;j++)
		if(a[i][j]=='#')ans=max(ans,pp+pre),pp=max(pp,pre),pre=0;
		else if(a[i][j]=='.')pre++;
		ans=max(ans,pp+pre);
	}
	for (int i=1;i<=m;i++){
		int pre=0,pp=0;
		for (int j=1;j<=n;j++)
		if(a[j][i]=='#')ans=max(ans,pp+pre),pp=max(pp,pre),pre=0;
		else if(a[j][i]=='.')pre++;
		ans=max(ans,pp+pre);
	}
	for (int i=1;i<=n;i++){
		int pre=0;
		for (int j=1;j<=m;j++)
		if(a[i][j]=='#')pre=0,f[i][j]=f[i][j-1];
		else if(a[i][j]=='.')pre++,f[i][j]=max(f[i][j-1],pre);
		ans=max(ans,mx+f[i][m]);mx=max(mx,f[i][m]);
	}
	mx=0;
	for (int i=1;i<=m;i++){
		int pre=0;
		for (int j=1;j<=n;j++)
		if(a[j][i]=='#')pre=0,g[j][i]=g[j-1][i];
		else if(a[j][i]=='.')pre++,g[j][i]=max(g[j-1][i],pre);
		ans=max(ans,mx+g[n][i]);mx=max(mx,g[n][i]);
	}
	for (int i=1;i<=n;i++){
		int pre=0;
		for (int j=m;j>=1;j--)
		if(a[i][j]=='#')pre=0,ff[i][j]=ff[i][j+1];
		else if(a[i][j]=='.')pre++,ff[i][j]=max(ff[i][j+1],pre);
	}
	for (int i=1;i<=m;i++){
		int pre=0;
		for (int j=n;j>=1;j--)
		if(a[j][i]=='#')pre=0,gg[j][i]=gg[j+1][i];
		else if(a[j][i]=='.')pre++,gg[j][i]=max(gg[j+1][i],pre);
	}
	sf[n+1]=sg[m+1]=0;
	for (int i=1;i<=n;i++)
	pf[i]=max(pf[i-1],f[i][m]);
	for (int i=n;i>=1;i--)
	sf[i]=max(sf[i+1],f[i][m]);
	for (int i=1;i<=m;i++)
	pg[i]=max(pg[i-1],g[n][i]);
	for (int i=m;i>=1;i--)
	sg[i]=max(sg[i+1],g[n][i]);
//	cout<<ans<<"@@@@\n";
	for (int i=1;i<=n;i++){
		int pre=0,pp=0,p3=1;
		for (int j=1;j<=m;j++)
		if(a[i][j]=='#')pre=0,pp=0,p3=j+1;
		else if(a[i][j]=='.'){
			pre++,pp=max(max(pp,g[i-1][j]),gg[i+1][j]);
			ans=max(ans,max(pg[p3-1],max(max(sg[j+1],max(pf[i-1],sf[i+1])),pp))+j-p3+1);
		}
	}
//	cout<<ans<<"&&&&\n";
	for (int i=1;i<=m;i++){
		int pre=0,pp=0,p3=1;
		for (int j=1;j<=n;j++)
		if(a[j][i]=='#')pre=0,pp=0,p3=j+1;
		else if(a[j][i]=='.'){
			pre++,pp=max(max(pp,f[j][i-1]),ff[j][i+1]);
			ans=max(ans,max(pf[p3-1],max(max(sf[j+1],max(pg[i-1],sg[i+1])),pp))+j-p3+1);
		}
	}
	cout<<ans<<"\n";
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int T;cin>>T;
	while(T--)solve();
}