#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1), EPS = 1e-7;
const int dx[] = {-1, 0, 0, 1, -1, 1, 1, -1};
const int dy[] = {0, -1, 1, 0, 1, 1, -1, -1};
long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return ((x / gcd(x, y)) * y); }
long long power(long long x, long long y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  long long r = power(x, y / 2);
  return r * r * power(x, y % 2);
}
void file() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
struct edge {
  int from, to, w;
  edge(int from, int to, int w) : from(from), to(to), w(w) {}
  bool operator<(const edge &e) const { return w > e.w; }
};
long long t, n;
void change(vector<long long> &v) {
  long long mx = LLONG_MIN;
  for (int i = 0; i < (n); ++i) mx = max(v[i], mx);
  for (int i = 0; i < (n); ++i) {
    v[i] = mx - v[i];
  }
}
int main() {
  file();
  int a;
  cin >> a;
  while (a--) {
    bool f = 0;
    cin >> n >> t;
    vector<long long> v(n);
    for (int i = 0; i < (n); ++i) cin >> v[i];
    if (n == 1) {
      cout << "0" << '\n';
      f = 1;
    } else if (t & 1)
      change(v);
    else {
      change(v);
      change(v);
    }
    if (f == 0) {
      for (int i = 0; i < (n); ++i) cout << v[i] << " ";
      cout << '\n';
    }
  }
}
