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  

#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; }
long long fact(int n) {
  long long i = 1;
  for (int c = 1; c <= n; c++) {
    i *= c;
    i %= MOD;
  }
  return i % MOD;
}
long long bigmod(int x, int y) {
  if (y == 1) return x % MOD;
  if (y == 0) return 1;
  long long ans = bigmod(x, y / 2);
  if (y & 1) return ((ans % MOD * ans % MOD) % MOD * x % MOD) % MOD;
  return (ans % MOD * ans % MOD) % MOD;
}
int n, m;
int d;
int r, g, b;
int vis[100009];
vector<int> v1, v2, v3;
long long dp[222][222][222];
long long solve(int i1, int i2, int i3) {
  int temp = (i1 == r) + (i2 == g) + (i3 == b);
  if (temp >= 2) return 0;
  if (dp[i1][i2][i3] != -1) return dp[i1][i2][i3];
  long long ans1 = 0, ans2 = 0, ans3 = 0;
  if (i1 < r && i2 < g) ans1 = solve(i1 + 1, i2 + 1, i3) + v1[i1] * v2[i2];
  if (i1 < r && i3 < b) ans3 = solve(i1 + 1, i2, i3 + 1) + v1[i1] * v3[i3];
  if (i3 < b && i2 < g) ans2 = solve(i1, i2 + 1, i3 + 1) + v3[i3] * v2[i2];
  return dp[i1][i2][i3] = max(ans1, max(ans2, ans3));
}
int main() {
  ios::sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int m;
    cin >> m;
    vector<long long> v(n);
    map<int, int> mp;
    long long mx = 0;
    for (int c = 0; c < n; c++) {
      cin >> v[c];
      mp[v[c]]++;
      mx = max(mx, v[c]);
    }
    long long mx2 = 0;
    for (int c = 0; c < n; c++) {
      v[c] = mx - v[c];
      mx2 = max(mx2, v[c]);
    }
    if (m & 1) {
      for (int c = 0; c < n; c++) {
        cout << v[c] << " ";
      }
      cout << endl;
      continue;
    }
    for (int c = 0; c < n; c++) {
      v[c] = mx2 - v[c];
    }
    for (int c = 0; c < n; c++) {
      cout << v[c] << " ";
    }
    cout << endl;
    continue;
  }
  return 0;
}
