for _ in range(int(input())):
n, k = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
m = max(a)
a = [m - i for i in a]
if k % 2:
print(*a)
else:
m = max(a)
a = [m - i for i in a]
print(*a)
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll i, t, n, k;
cin>>t;
while (t--){
cin>>n>>k;
ll a[n+1], mx = LLONG_MIN;
for (i = 1; i<=n; i++){
cin>>a[i];
mx = max(mx, a[i]);
}
if (k%2==0){
ll mn = LLONG_MIN;
for (i = 1; i<=n; i++){
a[i] = mx - a[i];
mn = max(mn, a[i]);
}
for (i = 1; i<=n; i++){
cout<<mn-a[i]<<' ';
}
}
else {
for (i = 1; i<=n; i++){
cout<<mx-a[i]<<' ';
}
}
cout<<endl;
}
}
1542A - Odd Set | 1567B - MEXor Mixup |
669A - Little Artem and Presents | 691B - s-palindrome |
851A - Arpa and a research in Mexican wave | 811A - Vladik and Courtesy |
1006B - Polycarp's Practice | 1422A - Fence |
21D - Traveling Graph | 1559B - Mocha and Red and Blue |
1579C - Ticks | 268B - Buttons |
898A - Rounding | 1372B - Omkar and Last Class of Math |
1025D - Recovering BST | 439A - Devu the Singer and Churu the Joker |
1323A - Even Subset Sum Problem | 1095A - Repeating Cipher |
630F - Selection of Personnel | 630K - Indivisibility |
20B - Equation | 600B - Queries about less or equal elements |
1015A - Points in Segments | 1593B - Make it Divisible by 25 |
680C - Bear and Prime 100 | 1300A - Non-zero |
1475E - Advertising Agency | 1345B - Card Constructions |
1077B - Disturbed People | 653A - Bear and Three Balls |