#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
 
#define pb push_back
#define MOD 1000000007
#define vll vector<ll>
#define endl "\n" 
#define all(v) v.begin(), v.end()
#define mem(a,b) memset(a, b, sizeof(a))
#define co(n) cout << n << endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x, n) for (int i = x; i < n; ++i)
#define fraction(x) cout << fixed << setprecision(x)
#define Baba_Yaga ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
 
const double eps = 1e-9;
const int N = 2e5+123;
 
ll gcd(ll a,ll b) { return __gcd(a,b); }
ll lcm(ll a,ll b) { return (a*b)/__gcd(a,b); }
 
int dx[] = {0, 0, +1, -1, +1, +1, -1, -1};
int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1};
 

void solve()
{
    ll n, m; cin >> n >> m;
    char arr[n][m];
    ll one  = 0;
    vector<pair<ll,ll>> vp;
    ll how_m = 0;

    for(int i=0; i<n; i++)
    {
        for(int j=0; j<m; j++)
        {
            cin >> arr[i][j];
            if(arr[i][j] == '+')
            {
                one = 1;
                vp.pb({i, j});
                how_m++;
            }
        }
    }
    if(one == 0)
    {
        cout << 0 << endl;
        return;
    }
    if(how_m == n*m)
    {
        cout << min(n, m) * 2 -1 << endl;
        return;
    }
    
    
    
    ll maxi = 0;
    for(int c=0; c<vp.size(); c++)
    {
        ll i = vp[c].first, j = vp[c].second;
           
        ll ct = 0;
        for(int k=1; k <= min(n/2, m/2) ; k++)
        {
            if(i+k >= n || j+k >= m || i-k < 0 || j-k < 0 || arr[i+k][j] != '+' || arr[i-k][j] != '+'|| arr[i][j+k] != '+' || arr[i][j-k] != '+')
            {
                break;
            }
            else ct++;
        }
        maxi = max(maxi, ct);      
    }
     
     cout << maxi * 4 + 1 << endl;

}

int main()
{
    Baba_Yaga;
    ll tc = 1; cin >> tc;
    for(int i=1; i<=tc; i++)
    {
       // cout << "Case " << i << ": ";
        solve();
    }   
}