1
2 1
-2 -3
 3
1 1
1
5 4
5 -1 4 2 0
1 2
69
 1
5 1
-5 -4 -3 -2 -1
 1
2 1
-6 -9
 1
1 398708496844866113
959414461
 1
2 1
-5 -4
 2
3 1
-1 -2 0
3 2
-1 -2 0
 1
5 1
-1 -2 -3 -4 -5
 1
2 1
-1000000000 -1000000000
 1
2 1
-199 -191
 1
1 1
-1000
 1
2 1
-5 -5
 1
5 5
-999999995 -999999996 -999999997 -999999998 -999999999
 1
3 1
-4 -5 -6
 1
1 1
-1
 1
3 1
-3 -4 -5
 1
3 1
-1000000000 -1000000000 -1000000000
 1
2 1
-10 -11
 1
3 3
-100 -100 -100
 1
3 1
-1 -2 -3
 1
5 5
-10 -9 -8 -7 -6
 1
4 1
-1 -1 -1 -1
 1
2 1
-1 -2
 1
3 999
1000000000 -1000000000 -31
 5
20 809014
289 -254 1 -109 -167 93 23 -37 -31 -109 204 59 296 49 132 0 -28 35 -197 -266
20 458494
113 218 -292 -298 179 258 -257 -20 296 76 -145 93 -282 -261 -159 -45 255 -107 171 63
14 876161
69 74 12 2 177 -113 103 93 38 -48 282 169 205 145
26 731742
76 190 -227 -81 -293 243 -122 -122 252 16 -88 243 -216 -275 -267 188 144 -245 -117 -244 -259 281 -273 -206 112 -51
20 327039
42 133 231 128 19 181 -137 193 136 75 -203 55 37 -155 -219 182 -178 -280 2 132
 4
6 4
219 57 -58 230 173 177
2 4
266 176
3 2
134 -190 202
5 69
-1000000000 -1000000000 1000000000 0 1000000000
 1
5 1
-9 -8 -7 -6 -5
 1
3 1
-1 -4 -10
 1
5 3
-4 -5 -6 -7 -8
 1
2 3
-3 -3
 1
5 1000000000000000000
-5 -4 -3 -2 -1

0 1  
 0  
6 0 5 3 1  
0  
 4 3 2 1 0  
 0 3  
 0  
 1 0  
 1 2 0  
1 0 2  
 0 1 2 3 4  
 0 0  
 8 0  
 0  
 0 0  
 0 1 2 3 4  
 0 1 2  
 0  
 0 1 2  
 0 0 0  
 0 1  
 0 0 0  
 0 1 2  
 4 3 2 1 0  
 0 0 0 0  
 0 1  
 0 2000000000 1000000031  
 555 12 267 157 99 359 289 229 235 157 470 325 562 315 398 266 238 301 69 0  
411 516 6 0 477 556 41 278 594 374 153 391 16 37 139 253 553 191 469 361  
213 208 270 280 105 395 179 189 244 330 0 113 77 137  
369 483 66 212 0 536 171 171 545 309 205 536 77 18 26 481 437 48 176 49 34 574 20 87 405 242  
189 98 0 103 212 50 368 38 95 156 434 176 194 386 450 49 409 511 229 99  
 277 115 0 288 231 235  
90 0  
324 0 392  
2000000000 2000000000 0 1000000000 0  
 4 3 2 1 0  
 0 3 9  
 0 1 2 3 4  
 0 0  
 0 1 2 3 4  

def str_list(s, char):
    output_list = []
    collector = ""
    for i in range(len(s)):
        if s[i] == char:
            if collector:
                output_list.append(int(collector))
                collector = ""
        else:
            collector += s[i]
    output_list.append(int(collector))
    return output_list


def merge_sort(l):
    def merge(l_1, l_2):
        i, j = 0, 0
        output_list = []
        while i < len(l_1) and j < len(l_2):
            if l_1[i] < l_2[j]:
                output_list.append(l_1[i])
                i += 1
            else:
                output_list.append(l_2[j])
                j += 1
        if i == len(l_1):
            output_list += l_2[j:]
        elif j == len(l_2):
            output_list += l_1[i:]
        return output_list

    def sorts(l):
        if len(l) < 2:
            return l
        else:
            mid = len(l) // 2
            left = sorts(l[:mid])
            right = sorts(l[mid:])
        return merge(left, right)
    return sorts(l)



def str_list_with_str(s, char):
    output_list = []
    collector = ""
    for i in range(len(s)):
        if s[i] == char:
            if collector:
                output_list.append(collector)
                collector = ""
        else:
            collector += s[i]
    output_list.append(collector)
    return output_list

def list_str(l, char):
    output_str = ""
    for i in range(len(l) - 1):
        output_str += str(l[i]) + char
    output_str += str(l[len(l) - 1])
    return output_str

def find_max(l, i , current_max):
    if i == len(l):
        return current_max
    else:
        if current_max < l[i]:
            current_max = l[i]
        return find_max(l, i + 1, current_max)


def simple_find_min_max(l):
    current_max  = l[0]
    current_min  = l[0]
    for i in l:
        if current_max > i:
            current_max = i
        if current_min < i:
            current_min = i
    return current_min, current_max


def simple_find_min(l):
    current_max  = l[0]
    for i in l:
        if current_max > i:
            current_max = i
    return current_max


def solve_recursively(l):
    pass



def main_function():
    test_cases = range(int(input()))
    output_list = []
    for test_case in test_cases:
        n, k = str_list(input(), " ")
        l = str_list(input(), " ")
        the_lowest, the_largest = simple_find_min_max(l)
        if not k % 2:
            ap = [i - the_lowest for i in l]
        else:
            if len(l) == 1:
                ap = [0]
            else:
                ap = [the_largest - i for i in l]
        str_l = list_str(ap, " ")
        output_list.append(str_l)
    return list_str(output_list, "\n")




    #     string = list_str(sorted_l, " ")
    #     output_list.append(string)
    # return list_str(output_list, "\n")



print(main_function())

