#include <fstream>
#include <vector>
using namespace std;

const int MAX_N = 52;

int T, N, M;
int A[MAX_N][MAX_N], S[MAX_N][MAX_N], pow2[62];
vector < pair < int, int > > v;
char s[MAX_N + 5];

int countOnes(int x1, int y1, int x2, int y2) {
	if(x1 > x2 || y1 > y2)
		return 0;

	return S[x2][y2] - S[x2][y1 - 1] - S[x1 - 1][y2] + S[x1 - 1][y1 - 1];
}

long long gcd(long long a, long long b) {
	while(b) {
		long long r = a % b;

		a = b;
		b = r;
	}

	return a;
}

bool check(int conf, int x1, int y1, int x2, int y2) {
    bool okX1 = 0, okX2 = 0, okY1 = 0, okY2 = 0;
    for(int i = 0; i < (int) v.size(); ++i) {
        if(!(conf & (1 << i)))
            continue;
        if(v[i].first == x1)
            okX1 = 1;
        else okX2 = 1;
        if(v[i].second == y1)
            okY1 = 1;
        else okY2 = 1;
    }

    return okX1 && okX2 && okY1 && okY2;
}

int main() {
	ifstream f("boundingbox.in");
	ofstream g("boundingbox.out");

	s[0] = ' ';

	pow2[0] = 1;
	for(int i = 1; i <= 60; ++i)
		pow2[i] = pow2[i - 1] * 2;

	f >> T;
	for(int t = 1; t <= T; ++t) {
		f >> N >> M;

		for(int i = 1; i <= N; ++i) {
			f >> (s + 1);

			for(int j = 1; j <= M; ++j)
				A[i][j] = s[j] - '0';
		}

		for(int i = 1; i <= N; ++i)
			for(int j = 1; j <= M; ++j)
				S[i][j] = A[i][j] + S[i][j - 1] + S[i - 1][j] - S[i - 1][j - 1];

		long long a = 0, b = 0;
		for(int x1 = 1; x1 <= N; ++x1)
            for(int y1 = 1; y1 <= M; ++y1)
                for(int x2 = x1; x2 <= N; ++x2)
                    for(int y2 = y1; y2 <= M; ++y2) {
                            int inside = countOnes(x1 + 1, y1 + 1, x2 - 1, y2 - 1);

                            v.clear();
                            for(int i = x1; i <= x2; ++i) {
                                if(A[i][y1])
                                    v.push_back(make_pair(i, y1));
                                if(A[i][y2] && y2 != y1)
                                    v.push_back(make_pair(i, y2));
                            }
                            for(int j = y1 + 1; j < y2; ++j) {
                                if(A[x1][j])
                                    v.push_back(make_pair(x1, j));
                                if(A[x2][j] && x2 != x1)
                                    v.push_back(make_pair(x2, j));
                            }

                            int n = v.size();
                            for(int conf = 0; conf < (1 << n); ++conf)
                                if(check(conf, x1, y1, x2, y2))
                                    a += pow2[inside] * (x2 - x1 + 1) * (y2 - y1 + 1);
                        }
		b = pow2[countOnes(1, 1, N, M)];

		int d;
		do {
			d = gcd(a, b);

			a /= d;
			b /= d;
		} while (d != 1);

		g << a << "/" << b << "\n";
	}

	f.close();
	g.close();

	return 0;
}