Problem: Being stuck at home, Ray became extremely bored. To pass time, he asks Lord Omkar to use his time bending power: Infinity Clock! However, Lord Omkar will only listen to mortals who can solve the following problem:

You are given an array a of n integers. You are also given an integer k. Lord Omkar wants you to do k operations with this array.

Define one operation as the following: 

  1. Set d to be the maximum value of your array. 
  2. For every i from 1 to n, replace a_{i} with d-a_{i}. 



The goal is to predict the contents in the array after k operations. Please help Ray determine what the final sequence will look like!

Input

Each test contains multiple test cases. The first line contains the number of cases t (1 ≤ t ≤ 100). Description of the test cases follows.

The first line of each test case contains two integers n and k (1 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ k ≤ 10^{18}) – the length of your array and the number of operations to perform.

The second line of each test case contains n integers a_{1},a_{2},...,a_{n} (-10^9 ≤ a_{i} ≤ 10^9) – the initial contents of your array.

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.

Output

For each case, print the final version of array a after k operations described above.

Example

Input


3
2 1
-199 192
5 19
5 -1 4 2 0
1 2
69


Output


391 0
0 6 1 3 5
0

Note

In the first test case the array changes as follows:

  * Initially, the array is [-199, 192]. d = 192.

  * After the operation, the array becomes [d-(-199), d-192] = [391, 0].

Solution (in PYTHON):

Solution:
import sys


def read_int(): return int(sys.stdin.readline())
def read_ints(): return [int(x) for x in sys.stdin.readline().strip('\n').split(' ')]


def solve_case(n, k, nums, min_num, max_num):
    if n == 1:
        return [0]
    k -= 1
    nums = [max_num - x for x in nums]
    max_num -= min_num
    if k & 1:
        return [max_num - x for x in nums]
    return nums


def main():
    cases_no = read_int()
    for i in xrange(cases_no):
        n, k = read_ints()
        nums = []
        min_num = int(10e9)
        max_num = int(-10e9)
        for x in sys.stdin.readline().strip('\n').split(' '):
            x = int(x)
            nums.append(x)
            min_num = min(x, min_num)
            max_num = max(x, max_num)
        for num in solve_case(n, k, nums, min_num, max_num):
            print num,
        print ''


main()