// Arup Guha
// 1/17/2014
// Solution to 2009 UCF Locals Problem: Positively Pentastic!

import java.util.*;

public class pentastic {

	public static void main(String[] args) {

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

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

			// Read in cases.
			int[] vals = new int[5];
			for (int i=0; i<5; i++)
				vals[i] = stdin.nextInt();

			// Keep on going.
			while (true) {

				int minI = 0;
				for (int i=1; i<5; i++)
					if (vals[i] < vals[minI])
						minI = i;

				// No negatives!
				if (vals[minI] >= 0) break;

				// Here is the change we want.
				vals[minI] = -vals[minI];
				vals[(minI+1)%5] -= vals[minI];
				vals[(minI+4)%5] -= vals[minI];
			}

			// Print result.
			System.out.println("Pentagon #"+loop+":");
			for (int i=0; i<4; i++)
				System.out.print(vals[i]+" ");
			System.out.println(vals[4]);
			System.out.println();
		}
	}
}