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

#define endl '\n'

int main()
{
   ios :: sync_with_stdio(false);cin.tie(0);cout.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;

        char arr[n][m];
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cin >> arr[i][j];
            }
        }

        int highest_pluses = 0;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                if(arr[i][j] =='+') {
                    int curr_pluses = 1;
                    int top = 0, bottom = 0, left = 0, right = 0;
                    // top
                    for(int k = i - 1; k >= 0; k--) {
                        if(arr[k][j] == '+') {
                            top++;
                        }
                        else {
                            break;
                        }
                    }
                    // bottom 
                    for(int k = i + 1; k < n; k++) {
                        if(arr[k][j] == '+') {
                            bottom++;
                        }
                        else {
                            break;
                        }
                    }
                    // left 
                    for(int k = j - 1; k >= 0; k--) {
                        if(arr[i][k] == '+') {
                            left++;
                        }
                        else {
                            break;
                        }
                    }
                    // right 
                    for(int k = j + 1; k < m; k++) {
                        if(arr[i][k] == '+') {
                            right++;
                        }
                        else {
                            break;
                        }
                    }

                    curr_pluses += 4 * min({top, bottom, left, right});

                    highest_pluses = max(curr_pluses, highest_pluses);
                }
            }
        }
        cout << highest_pluses << endl;
    } 
    return 0;
}