// Arup Guha
// 2/2/2014
// Solution to 2014 UCF HS Online Contest Problem: Track

import java.util.*;

public class track {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {

			int v1 = stdin.nextInt();
			int v2 = stdin.nextInt();
			int n = stdin.nextInt();

			// Make 0 an extra spot.
			int[] spots = new int[n+1];
			spots[0] = 0;
			for (int i=1; i<=n; i++)
				spots[i] = stdin.nextInt();
			int d = stdin.nextInt();

			// This is really how far we go before meeting.
			double maxd = ((double)d)/(v1+v2)*v1;

			// Find maximum item on list less than the distance we can go, and output.
			int ans = 0, index = 0;
			while (index < n && maxd > spots[index+1]) index++;
			System.out.println("Race #"+loop+": Mike, drift like a boss for "+spots[index]+" miles.");
		}
	}
}