#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int N=;

 int n,m;

 char mp[N][N];

 int dp[N][N];

 int ll[N],rr[N],ans;

 int main(){

   int cas;

   scanf("%d",&cas);

   while(cas--){

     scanf("%d%d",&n,&m);

     for(int i=;i<=n;i++)

         for(int j=;j<=m;j++)

           cin>>mp[i][j];

     for(int i=;i<=m;i++){

             int temp=;

         for(int j=;j<=n;j++){

             if(mp[j][i]=='F')

                ++temp;

             else

                temp=;

             dp[j][i]=temp;

         }

     }

       ans=;

        for(int i=n;i>=;i--){

         memset(ll,,sizeof(ll));

         memset(rr,,sizeof(rr));

         dp[i][]=-;dp[i][m+]=-;

         for(int j=;j<=m;j++){

             ll[j]=j;

             if(j==)continue;

             int t=j-;

           while(dp[i][j]<=dp[i][t]){

              ll[j]=ll[t];

              t=ll[t]-;

           }

         }

          for(int j=m;j>=;j--){

             rr[j]=j;

             if(j==m)continue;

             int t=j+;

           while(dp[i][j]<=dp[i][t]){

              rr[j]=rr[t];

              t=rr[t]+;

           }

         }

        for(int k=;k<=m;k++){

         ans=max(ans,(rr[k]-ll[k]+)*dp[i][k]);

        }

       }

    printf("%d\n",ans*);

   }

 }