// Arup Guha
// 4/7/2020
// Solution to COP 4516 Team Final Exam Problem: Soccer Shots

import java.util.*;

public class soccer {

	public static void main(String[] args) {
	
		Scanner stdin = new Scanner(System.in);
		int nC = stdin.nextInt();
		
		// Process all cases.
		for (int loop=0; loop<nC; loop++) {
		
			int n = stdin.nextInt();
			int aim = stdin.nextInt();
			int range = stdin.nextInt();
			
			// We can hit upto range to the right and range to the left
			// of the goal (since we always aim somewhere within the goal.)
			int hit = Math.min(n-aim, range) + Math.min(aim, range);
			
			// Our denominator is twice the range. Here we reduce.
			int div = gcd(hit, 2*range);
			
			// Here is the desired fraction in lowest terms.
			System.out.println((hit/div)+"/"+((2*range)/div));
		}
	}
	
	// returns gcd of a and b.
	public static int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a%b);
	}
}