// David Nikdel
// 7/27/05
// Created this java solution from the .c solution for the 1993 UCF HS contest.

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

class subtract
{
	

	// Returns true iff num has all zeroes in it.	
	public static boolean all_zeroes(int[] num)
	{
	    for (int i = 0; i < 4; i++ )
	    {
	        if ( num[i] != 0 )
	        	return false;
	    }
		return true;
	}
	
	static void write_and_update(int[] num)
	{
	    num[4] = num[0];	
	    for (int i = 0; i < 4; i++ )
	    {
	    	System.out.print(num[i]);
	    	if (i<3)
	    		System.out.print(" ");
	        num[i] = Math.abs( num[i]-num[i+1] );
	    }
	    System.out.println("");
	}
	
	public static void main(String[] args) throws IOException
	{
		Scanner in = new Scanner(new File("subtract.in"));
		
		int n = in.nextInt();
		
		for (int i=1; i<=n; i++)
		{
			int[] num = new int[5];
			num[0] = in.nextInt();
			num[1] = in.nextInt();
			num[2] = in.nextInt();
			num[3] = in.nextInt();
			
			System.out.println("Case "+i+":");
	        do
	        {
	            write_and_update(num);
	        } while ( !all_zeroes(num) );
	        
	        System.out.println("");
		}
	}
}