Bricks in the Wall

Bob is decorating a loft-style rectangular wall with bricks. The wall consists of $n \times m$ unit cells. Some cells are already occupied by bricks, while the remaining cells are empty.

Bob wants to add up to two more bricks to this wall. New bricks must have a width equal to $1$ unit and can have any positive integer length. Each brick can only be placed horizontally or vertically, so each new brick occupies several consecutive empty cells in one row or in one column. Also, these two bricks must not intersect, i.e. occupy the same cell.

What is the maximum possible sum of lengths of at most two new bricks that Bob can add to this wall?

The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). The description of the test cases follows.

The first line of each test case contains two integers $n$ and $m$, the height and the width of the wall ($1 \le n, m$; $n \cdot m \le 10^6$).

The next $n$ lines contain $m$ characters each, describing the wall. An occupied cell is denoted by #, and an empty cell is denoted by ..

It is guaranteed that the sum of $n \cdot m$ over all test cases does not exceed $10^6$.

For each test case, print a single integer, the maximum possible sum of lengths of at most two new bricks.