#include<fstream>
#define FOR(a,b,c) for(register int a=b;a<=c;++a)
#define ROF(a,b,c) for(register int a=b;a>=c;--a)
#include<queue>
#include<stack>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<vector>
#define fi first
#define se second
#define FIT(a,b) for(vector<int>::iterator a=b.begin();a!=b.end();++a)
#include<ctime>
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<deque>
#define mod 1000000007
#define N 5000
#define SQ 1400
#define pb push_back
using namespace std;
ifstream f("boundingbox.in");
ofstream g("boundingbox.out");
int gcd(int a,int b)
{
	if(!b)
		return a;
	return gcd(b,a%b);
}
int T,S,x[N],y[N],t,m,limi,freq[N],kkt,xmi,xma,ymi,yma,p,tot,n;
char s[N][N];
int main ()
{
	f>>T;
	while(T--)
	{
		f>>n>>m;
		FOR(i,1,n)
		f>>(s[i]+1);
		
		t=0;
		FOR(i,0,n*m)
		freq[i]=0;
		FOR(i,1,n)
		FOR(j,1,m)
		if(s[i][j]=='1')
		{
			x[++t]=i;
			y[t]=j;
		}
		limi=(1<<t);
		limi--;
		tot=1;
		FOR(i,1,limi)
		{
			int X=i;
			int p=1;
			xmi=n+1;
			ymi=m+1;
			xma=yma=0;
			while(X)
			{
				if(X&1)
				{
					xmi=min(xmi,x[p]);
					ymi=min(ymi,y[p]);
					xma=max(xma,x[p]);
					yma=max(yma,y[p]);
				}
				p++;
				X>>=1;
			}
			freq[(xma-xmi+1)*(yma-ymi+1)]++;
			tot++;
		}
		S=0;
		FOR(i,0,n*m)
			S+=i*freq[i];
		kkt=gcd(S,tot);
		g<<S/kkt<<"/"<<tot/kkt<<"\n";
	}
	return 0;
}

//Look at me! Look at me! The monster inside me has grown this big!