Array Transformation Problem

Given an array ARR consisting of N integers and a non-negative integer K. An operation on the array replaces each element ELE with MX - ELE, where MX is the maximum element of the array. Perform this operation exactly K times and return the updated array.

Input:

A single integer 'T' indicating the number of test cases. For each test case, the first line contains two integers 'N' and 'K'. The second line contains 'N' space-separated integers representing the array elements.

Output:

For each test case, print the transformed array elements as single space-separated integers after 'K' operations.

Example:

Input:

2
3 1
1 2 3
4 2
5 7 2 -1

Output:

2 1 0
3 1 6 9

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 104
• -109 ≤ ARR[i] ≤ 109
• 0 ≤ K ≤ 109

Note:

The array is zero-indexed, and subsequent operations are performed on the updated array obtained from the previous operation.