#include <bits/stdc++.h>
using namespace std;

int slv(int n, int m, vector<vector<char>> &c) {
	int ans = 0;
	{ // horizontal
		vector<int> consec(m); int maxback = 0;
		for (int i = 0; i < n; i++) {
			// one horizon here only
			int cns = 0, mx = 0;
			for (int j = 0; j < m; j++) {
				if (c[i][j] == '.') {
					cns++;
				} else {
					cns = 0;
				}

				mx = max(mx, cns); 
				ans = max(ans, mx + maxback);
			}

			maxback = max(maxback, mx);
			for (int j = 0; j < m; j++) {
				if (c[i][j] == '.') {
					consec[j]++;
				} else {
					consec[j] = 0;
				}
				maxback = max(maxback, consec[j]);
			}

			// two horizon same
			vector<int> cz; int cs = 0;
			for (int j = 0; j <= m; j++) {
				if (j < m && c[i][j] == '.') {
					cs++;
				} else {
					if (cs > 0) cz.push_back(cs); 
					cs = 0;
				}
			}
			if (cz.size()) sort(cz.begin(), cz.end(), greater<int>());
			if (cz.size() >= 1) ans = max(ans, cz[0]);
			if (cz.size() >= 2) ans = max(ans, cz[0] + cz[1]);
		}
	}

	{ // vertical
		vector<int> consec(n); int maxback = 0;
		for (int i = 0; i < m; i++) {
			// one vertical here only
			int cns = 0, mx = 0;
			for (int j = 0; j < n; j++) {
				if (c[j][i] == '.') {
					cns++;
				} else {
					cns = 0;
				}

				mx = max(mx, cns); 
				ans = max(ans, mx + maxback);
			}

			maxback = max(maxback, mx);
			for (int j = 0; j < n; j++) {
				if (c[j][i] == '.') {
					consec[j]++;
				} else {
					consec[j] = 0;
				}
				maxback = max(maxback, consec[j]);
			}

			// two vertical same
			vector<int> cz; int cs = 0;
			for (int j = 0; j <= n; j++) {
				if (j < n && c[j][i] == '.') {
					cs++;
				} else {
					if (cs > 0) cz.push_back(cs);
					cs = 0;
				}
			}
			if (cz.size()) sort(cz.begin(), cz.end(), greater<int>());
			if (cz.size() >= 1) ans = max(ans, cz[0]);
			if (cz.size() >= 2) ans = max(ans, cz[0] + cz[1]);
		}
	}
	return ans;
}

void solve() {
	int n, m; cin >> n >> m;
	vector<vector<char>> c(n, vector<char>(m));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> c[i][j];
		}
	}

	int ans = slv(n, m, c);
	// flip left
	for (int i = 0; i < n; i++) {
		for (int j = 0, k = m-1; j < k; j++, k--) {
			swap(c[i][j], c[i][k]);
		}
	}
	ans = max(ans, slv(n, m, c));

	// flip down
	for (int i = 0; i < m; i++) {
		for (int j = 0, k = n-1; j < k; j++, k--) {
			swap(c[j][i], c[k][i]);
		}
	}
	ans = max(ans, slv(n, m, c));

	// flip left
	for (int i = 0; i < n; i++) {
		for (int j = 0, k = m-1; j < k; j++, k--) {
			swap(c[i][j], c[i][k]);
		}
	}
	ans = max(ans, slv(n, m, c));
	
	cout << ans << '\n';
}

signed main() {
	//ios::sync_with_stdio(0); cin.tie(0);
	
	int t; cin >> t;
	while (t--) {
		solve();
	}	

	return 0;
}