#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define LL long long
#define DB double
#define N 1005
#define esp 1e-6
const int INF = 0x3f3f3f3f;
const LL INFF = 1LL << 60;
const DB EPS = 1e-9;
const DB OO = 1e15;
const DB PI = acos(-1.0);
char ma[N][N];
int dp[N][N],r[N],dp1[N][N];
int main()
{
    int i,j,k,t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        memset(ma,0,sizeof(ma));
        scanf("%d %d",&n,&m);
        for(i = 1; i <= n ; i++)
        {
            for(j = 1 ; j <= m ; j++)
            {
                cin>>ma[i][j];
            }
        }
        memset(dp,0,sizeof(dp));
        for(i = 1 ; i <= n ; i++)
        {
            for(j = 1 ; j <= m ; j++) r[j] = j+1;
            for(j = m ; j >=1 ; j--){
                if(ma[i][j]==‘F‘)
                {
                    int cur = r[j];
                    while(ma[i][cur]==‘F‘) cur = r[cur];
                    dp[i][j] = cur-j;
                }
            }
        }
        int ans = 0;
        memset(dp1,0,sizeof(dp1));
        for(j = 1 ; j <=m ; j++)
        {
            for(i= 1 ; i <= n ; i++) r[i] = i+1;
            for(i = n ; i>= 1; i--)  {
                if(ma[i][j]==‘F‘)
                {
                    int cur = r[i];
                    while(ma[cur][j] ==‘F‘) cur = r[cur];
                    dp1[i][j] = cur - i;
                }
            }
        }
        for(i = 1 ; i <= n ; i++)
        {
            for(j = 1 ; j <= m ; j++)
            {
                if(dp[i][j]>0&&dp1[i][j]>0&&dp[i][j]*dp1[i][j]>ans)
                {
                    int a = INF;
                    for(k = 0 ; k<dp[i][j] ; k++)
                        a = min(a,dp1[i][j+k]);
                    ans = max(ans,a*dp[i][j]);
                    a = INF;
                    for(k = 0 ; k <dp1[i][j] ; k++)
                        a = min(a,dp[i+k][j]);
                    ans = max(ans,a*dp1[i][j]);
                }
            }
        }
        printf("%d\n",ans*3);
    }
    return 0;
}