#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<fstream>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
const string problemName = "boundingbox";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";

typedef long long int lld;
typedef pair<int, int> PII;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;

int T, R, C, P;
char A[55][55];
lld X, Y;
vector<PII> M;

lld cmmdc(lld a, lld b) {
    lld r = a % b;
    while(r) {
        a = b;
        b = r;
        r = a % b;
    }
    return b;
}

int main() {
    int i, j, x1, y1, x2, y2;
    lld d;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &T);

    while(T--) {
        M.resize(0);

        scanf("%d%d", &R, &C);

        for(i = 1; i <= R; i++)
            scanf("%s", A[i] + 1);

        for(i = 1; i <= R; i++)
            for(j = 1; j <= C; j++)
                if(A[i][j] == '1')
                    M.push_back(make_pair(i, j));

        P = (1 << (M.size())) - 1;

        X = 0;
        Y = 1;

        for(i = 1; i <= P; i++) {
            x1 = y1 = INF;
            x2 = y2 = -INF;
            for(j = 0; j < M.size(); j++)
                if(i & (1 << j)) {
                    x1 = min(x1, M[j].first);
                    y1 = min(y1, M[j].second);
                    x2 = max(x2, M[j].first);
                    y2 = max(y2, M[j].second);
                }
            X += (x2 - x1 + 1) * (y2 - y1 + 1);
            Y++;
        }

        d = cmmdc(X, Y);

        printf("%lld/%lld\n", X / d, Y / d);
    }

    return 0;
}