// Arup Guha
// 4/2/2017
// Solution to 1991 UCF HS Contest Problem: Raiders of the Last Arc

import java.util.*;

public class raiders {

	final public static int PACELEN = 4;
	final public static int[] WINDOW = {0, 50, 100};

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		// Read till eof
		while (stdin.hasNext()) {

			// Get input.
			int zVal = stdin.nextInt()*PACELEN;
			int xVal = stdin.nextInt()*PACELEN;
			double staff = stdin.nextDouble();

			// Use similar traingles to figure out where the shadow will be case.
			double shadowX = xVal*WINDOW[2]/(WINDOW[2]-zVal);
			double shadowY = WINDOW[1] - WINDOW[2]*(WINDOW[1] - staff)/(WINDOW[2]-zVal);

			// Output result.
			System.out.printf("The last arc is at (%.2f, %.2f).\n", shadowX, shadowY);
		}
	}
}