#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

long long gcd(long long firstNumber, long long secondNumber) {
	if (firstNumber == 0) {
		return secondNumber;
	}
	else {
		return gcd(secondNumber % firstNumber, firstNumber);
	}
}

void outputProbability(long long maxNumber, long long maxSum) {
	long long allVariants = maxNumber * (maxNumber - 1) / 2;
	long long goodVariants = 0;
	if (maxSum % 2) {
		goodVariants += (maxSum - 1) / 2;
		--maxSum;
	}
	long long minMember = 0, maxMember = (maxSum - 1) / 2, amount = maxSum / 2;
	goodVariants += (minMember + maxMember) * amount;
	if (goodVariants == 0) {
		cout << 0 << endl;
	}
	else if (goodVariants == allVariants) {
		cout << 1 << endl;
	}
	else {
		long long greasestDivisor = gcd(goodVariants, allVariants);
		cout << goodVariants / greasestDivisor << "/" << allVariants / greasestDivisor << endl;
	}
}

int main()
{
	long long maxNumber, maxSum;
	while (cin >> maxNumber >> maxSum) {
		if (maxNumber == -1 && maxSum == -1) {
			break;
		}
		else {
			outputProbability(maxNumber, maxSum);
		}
	}
	return 0;
}