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 PYTHON3):

Solution:
"""
AUTHOR:AMIT KUMAR
INSTITUTE OF ENGINEERING AND MANAGEMENT,KOLKATA
"""
import math
import os
import random
import re
import string
from sys import *
from collections import *
#"Case #"+str(_+1)+":"+" "+str(c)
#l=list(map(int,stdin.readline().strip().split()))
def bs(arr,x,l,r):
    if l<=r:
        mid=(r+l)//2
        if arr[mid]==x:
            return mid
        elif arr[mid]>x:
            return bs(arr,x,l,mid-1)
        else:
            return bs(arr,x,mid+1,r)
    else:
        return -1  
def solve():
    for _ in range(int(input())):
        n,k=map(int,stdin.readline().strip().split())
        l=list(map(int,stdin.readline().strip().split()))
        ma=max(l)
        res1=[0]*n
        for i in range(n):
            res1[i]=ma-l[i]
        res2=[0]*n
        ma1=max(res1)
        for i in range(n):
            res2[i]=ma1-res1[i]
        if k==1:
            print(*res1)
        elif k==2:
            print(*res2)
        else:
            k-=2
            r=k%2
            if r==1:
                print(*res1)
            else:
                print(*res2)
        
            
        
if __name__=="__main__":
    solve()