#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> solve(vector<vector<int>>arr, int n, int m){
	vector<int>ans(n+1);
	vector<vector<int>>dp(n+1,vector<int>(m+1));
	for(int i = 1; i<=n; i++){
		int cur = 0;
		int mx = 0;
		for(int j = 1; j<=m; j++){
			if(arr[i][j]){
				cur++;
				mx = max(mx,cur);
			}
			else{
				cur = 0;
			}
		}
		ans[i] = mx;
		ans[i] = max(ans[i],ans[i-1]);
		for(int j = 1; j<=m; j++){
			if(arr[i][j]==1){
				dp[i][j] = dp[i-1][j]+1;
			}
			ans[i] = max(ans[i],dp[i][j]);
		}
	}
	return ans;
}
vector<int> solve2(vector<vector<int>>arr, int n, int m){
	vector<int>ans(m+1);
	vector<vector<int>>dp(n+1,vector<int>(m+1));
	for(int j = 1; j<=m; j++){
		int cur = 0;
		int mx = 0;
		for(int i = 1; i<=n; i++){
			if(arr[i][j]){
				cur++;
				mx = max(mx,cur);
			}
			else{
				cur = 0;
			}
		}
		ans[j] = mx;
		ans[j] = max(ans[j],ans[j-1]);
		for(int i = 1; i<=n; i++){
			if(arr[i][j]==1){
				dp[i][j] = dp[i][j-1]+1;
			}
			ans[j] = max(ans[j],dp[i][j]);
		}
	}
	return ans;
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int t;
	cin >> t;
	while(t--){
		int n,m;
		cin >> n >> m;
		vector<vector<int>>arr(n+1,vector<int>(m+1));
		vector<vector<int>>arr2(n+1,vector<int>(m+1));
		vector<vector<int>>arr3(n+1,vector<int>(m+1));
		for(int i = 1; i<=n; i++){
			string s;
			cin >> s;
			for(int j = 1; j<=m; j++){
				if(s[j-1]=='.'){
					arr[i][j] = 1;
				}
				arr2[n+1-i][j] = arr[i][j];
				arr3[i][m+1-j] = arr[i][j];
			}
		}
		int ans = 0;
		if(true){
			vector<int>a = solve(arr,n,m);
			vector<int>b = solve(arr2,n,m);
			reverse(b.begin()+1,b.end());
			ans = max(ans,b[1]);
			ans = max(ans,a[n]);
			for(int i = 1; i<n; i++){
				ans = max(ans,a[i]+b[i+1]);
			}
		}
		if(true){
			vector<int>a = solve2(arr,n,m);
			vector<int>b = solve2(arr3,n,m);
			reverse(b.begin()+1,b.end());
			ans = max(ans,b[1]);
			ans = max(ans,a[m]);
			for(int i = 1; i<m; i++){
				ans = max(ans,a[i]+b[i+1]);
			}
		}
		cout << ans << '\n';
	}
	return 0;
}