While relaxing on a meadow you've noticed an incredible spectacle: a group of grasshoppers was jumping in a circle. You found the dance particularly beautiful, as you realized that their moves were not random, but followed a mathematical pattern.
There are m points marked on the circle. These points are numbered from 1 to m in the order they appear on the circle and divide the circle into arcs of equal length. There are grasshoppers in some of these points, possibly more than one grasshopper in the same point. The grasshoppers are numbered from 1 to n. Each second grasshoppers jump to new locations according to the following rule: If at the beginning of the second the grasshoppers 1,2,…,n are standing in points A_1,A_2,…,A_n respectively, and O is the center of the circle, then at the end of the second the grasshoppers will be standing at positions B_1,B_2,…,B_n, where B_k is the reflection of point A_k over the line OA_k+1 for k=1,2,…,n−1, and B_n is the reflection of point A_n over the line OA_1. The grasshoppers' numbers do not necessarily correspond to their order in the circle, and do not change during the dance.
You need to go back home now, but you are wondering what will happen later on. Given the initial arrangement of the grasshoppers, find their positions after t seconds.
The first line of input contains the number of test cases z (1≤z≤109). The descriptions of the test cases follow.
The first line of each test case contains three integers n,m,t (1≤n≤100,000, 3≤m≤100, 1≤t≤109): the number of grasshoppers, the number of arcs and the number of seconds. The second line contains n integers denoting initial positions of the grasshoppers. The positions are integers between 1 and m inclusive. The total number of grasshoppers in all test cases does not exceed 200,000.
For each test case, output positions of the grasshoppers after t seconds, separated by spaces.