#include <bits/stdc++.h>
using namespace std;
long long int mod97 = 1000000007;
double pi = 3.1415926536;
bool comp(pair<long long int, long long int> a,
          pair<long long int, long long int> b) {
  if (a.first == b.first) {
    if (a.second <= b.second)
      return true;
    else
      return false;
  }
  if (a.first > b.first)
    return true;
  else
    return false;
}
bool rev(long long int a, long long int b) {
  if (a > b)
    return true;
  else
    return false;
}
bool compa(pair<string, pair<int, int>> a, pair<string, pair<int, int>> b) {
  if (a.first == b.first) {
    if (a.second.first > b.second.first)
      return true;
    else
      return false;
  }
  if (a.first < b.first)
    return true;
  else
    return false;
}
long long int gcd(long long int bdda, long long int chota) {
  if (chota == 0) return bdda;
  return gcd(chota, bdda % chota);
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int a[n];
  for (auto &x : a) cin >> x;
  long long int ma = INT_MIN;
  for (auto x : a) ma = max(x, ma);
  for (long long int i = 0; i < n; i++) {
    a[i] = ma - a[i];
  }
  if (k % 2 == 1) {
    for (auto x : a) cout << x << " ";
    cout << endl;
  } else {
    long long int ma = INT_MIN;
    for (auto x : a) ma = max(x, ma);
    for (long long int i = 0; i < n; i++) {
      a[i] = ma - a[i];
    }
    for (auto x : a) cout << x << " ";
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
