import java.util.Scanner;
import java.util.Vector;

public class AimItRight {

	private static int solveAimItRight(int point_a_x, int point_a_y, int point_b_x, int point_b_y, int radius) {
		int minRebounds = -1;

		/* ------------------- INSERT CODE HERE ---------------------
		 * Compute the minimum number of rebounds required to go from point A to point B, and assign that
		 * value to minRebounds.
		 *
		 * If it is not possible to hit point B from point A, then minRebounds should be assigned -1. */










		/* -------------------- END OF INSERTION --------------------*/

		return minRebounds;
	}

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int numCases = sc.nextInt();

		for(int i = 0; i < numCases; i++) 
		{
			int point_a_x = sc.nextInt();

			int point_a_y = sc.nextInt();

			int point_b_x = sc.nextInt();

			int point_b_y = sc.nextInt();

			int radius = sc.nextInt();

			int ans = solveAimItRight(point_a_x, point_a_y, point_b_x, point_b_y, radius);

			if(ans == -1) {
				System.out.println("NOT POSSIBLE");
			} else {
				System.out.println("REBOUNDS " + ans);
			}
		}
	}
}