#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stdio.h>
using namespace std;
long long mod = 1e9+7;

class rational
{
public:
    long long nom; long long denom;
	rational (long long a) {nom=a, denom=1;}
	rational (long long a, long long b) {nom=a, denom=b;}
	rational () {nom=1, denom=1;}
};

long long gcd(long long a, long long b)
{
	if (a==0) return b;
	return gcd(b%a, a);
}

rational reduce (rational a)
{
	long long g=gcd(a.nom, a.denom);
	a.nom/=g; a.denom/=g;
	return a;
}

rational operator +(rational a, rational b)
{
	rational c(a.nom*b.denom+b.nom*a.denom, a.denom*b.denom);
	c=reduce (c);
	return c;
}

rational operator * (rational a, rational b)
{
	rational c(a.nom*b.nom, a.denom*b.denom);
	c=reduce (c);
	return c;
}



int main()
{
	long long t; cin>>t;
	for (long long z=0; z<t; ++z)
	{
		long long a, b; cin>>a>>b;
		if (a>b) swap(a,b);
		rational ans;
		if (a==1) 
		{
			if (b==2) ans=2;
			if (b==3) ans=2;
			if (b==4) ans=3;
			if (b>=5) {rational prob_m(3,4), prob_e(1,2), prob_c(1,1); ans = 2*prob_e + 2*prob_c + (b-4)*prob_m;}
		}


		if (a==2)
		{
			if (b==2) ans=3;
			if (b==3) {rational prob(13,3); ans = prob;}
			if (b==4) {rational prob(52,9); ans = prob;}
			if (b>=5) {rational prob_m(19,27), prob_e(2,3), prob_c(7,9); ans = 4*prob_e + 4*prob_c + 2*(b-4)*prob_m;}
		}

		if (a==3)
		{
			if (b==3) {rational prob(515,81); ans = prob;}
			if (b==4) {rational prob(77,9); ans = prob;}
			if (b>=5) {rational prob(77,9), prob1(2,3), prob2(3,4); ans = prob + (b-4)*2*prob1 + (b-4)*prob2;}
		}

		if (a==4)
		{
			if (b==4) {rational prob(101,9); ans = prob;}
			if (b>=5) {rational prob(101,9), prob1(2,3), prob2(23,32); ans = prob + 2*(b-4)*prob1 + 2*(b-4)*prob2;}
		}

		if (a>=5)
		{
			{rational prob(101,9), prob1(2,3), prob2(23,32); ans = prob + (2*(a-4)+2*(b-4))*prob1 + (2*(a-4)+2*(b-4))*prob2;    rational prob3(175, 256); ans = ans+(a-4)*(b-4)*prob3;}
		}


		ans=reduce (ans);

		if (ans.denom==1) {cout<<ans.nom<<"\n";}
		else {cout<<ans.nom<<"/"<<ans.denom<<"\n";}
	}
	
}