// Arup Guha
// 10/10/2013
// Solution to 2012 UCF HS Contest Problem: Track

import java.util.*;
import java.io.*;

public class track {

	public static void main(String[] args) throws Exception {

		Scanner stdin = new Scanner(new File("track.in"));
		int n = stdin.nextInt();

		// Go through each case.
		for (int loop=1; loop<=n; loop++) {

			// Get all the data.
			int straight = stdin.nextInt();
			int smallR = stdin.nextInt();
			int bigR = stdin.nextInt();
			int mackLaps = stdin.nextInt();
			int zackLaps = stdin.nextInt();

			// Calculate the full distance each has run.
			double mackD = mackLaps*(2*straight+2*Math.PI*smallR);
			double zackD = zackLaps*(2*straight+2*Math.PI*bigR);

			// When we output here, we need to round, so use the casting truncation, we must add .5
			if (zackD > mackD)
				System.out.printf("Track #%d: I've run %d more meters than Mack!!!\n", loop, (int)(zackD - mackD+.5));
			else
				System.out.printf("Track #%d: Drats!\n", loop);
		}

		// Close file.
		stdin.close();
	}
}