# Arup Guha
# 7/18/2013
# Solution to SI@UCF Practice Contest Problem: Subtract

import math

def main():

    myFile = open("subtract.in")
    numCases = int(myFile.readline())

    # Go through each case.
    for loop in range(1, numCases+1):

        # Read in the original line of numbers.
        myScoops = myFile.readline().split()

        # Convert to list of ints.
        nums = []
        for i in range(len(myScoops)):
            nums.append(int(myScoops[i]))

        # Case header
        print("Case ",loop,":", sep="")
        
        # Print first line.
        printList(nums)
            
        # Continue until all values are equal.
        while notequal(nums):

            # Calculate each new item, don't forget abs or the wrap-around!
            newlist = [0]*len(nums)
            for i in range(len(nums)):
                newlist[i] = int(math.fabs(nums[(i+1)%len(nums)] - nums[i]))

            nums = newlist

            # Print the next iteration.
            printList(nums)

        print()
        
    myFile.close()

# Prints out this list as designated by the problem.
def printList(mylist):
    for i in range(len(mylist)):
        print(mylist[i], end = " ")
    print()
    
def notequal(mylist):

    # See if two adjacent items are unequal.
    for i in range(len(mylist)-1):
        if mylist[i] != mylist[i+1]:
            return True

    # If we get here, our list is done!
    return False

main()