#include<iostream> 
#include<cstdio> 
#include<cstdlib>
#include<algorithm> 
#include<set>
#include<map> 
#include<queue> 
#include<vector> 
#include<list>
#include<stack>
#include<cmath>
#include<cstring>
using namespace std; int main() { int i,j,k,l,m,n,o,p,i1,i2,j1,j2; int T; cin>>T; while(T--) { int R,C; cin>>R>>C; char a[R][C]; for(i=0;i<R;i++) for(j=0;j<C;j++) cin>>a[i][j]; int ans=0; for(i=0;i<R;i++) { for(j=i;j<R;j++) { for(k=0;k<C;k++) { for(l=k;l<C;l++) { int rd=j-i;int rc=l-k; if(ans>=(rd+1)*(rc+1)) continue; int m=0,n=m+rd; while(n<R) { int o=0,p=o+rc; bool po2=0; while(p<C) { bool po=1; for(i1=i,i2=m;i1<=j;i1++,i2++) for(j1=k,j2=o;j1<=l;j1++,j2++) {if(a[i1][j1]==a[i2][j2] && !(i==m && j==n && k==o && l==p)) continue; else {po=0;break;} } if(po) { ans=max(ans,(rd+1)*(rc+1)); po2=1; break; } o++;p++; } if(po2) break; m++;n++; } } } } } cout<<ans<<"\n"; } return 0; }