CF1392B.Omkar and Infinity Clock

Being stuck at home, Ray became extremely bored. To pass time, he asks Lord Omkar to use his time bending power: Infinity Clock! However, Lord Omkar will only listen to mortals who can solve the following problem:

You are given an array $a$ of $n$ integers. You are also given an integer $k$. Lord Omkar wants you to do $k$ operations with this array.

Define one operation as the following:

1. Set $d$ to be the maximum value of your array.
2. For every $i$ from $1$ to $n$, replace $a_{i}$ with $d-a_{i}$.

The goal is to predict the contents in the array after $k$ operations. Please help Ray determine what the final sequence will look like!

待在家中无所事事的 Ray 感到极度无聊。为了消磨时间，他请求奥姆卡尔大人施展其时间扭曲神力——“无限时钟”！然而，奥姆卡尔大人只听从那些能解决如下问题的凡人：

给定一个包含 $n$ 个整数的数组 $a$，以及一个整数 $k$。奥姆卡尔大人要求你对该数组执行 $k$ 次操作。

定义一次操作如下：

1. 令 $d$ 为当前数组中的最大值；
2. 对每个 $i$（从 $1$ 到 $n$），将 $a_{i}$ 替换为 $d - a_{i}$。

目标是预测经过 $k$ 次操作后数组的内容。请帮助 Ray 确定最终的序列！

Each test contains multiple test cases. The first line contains the number of cases $t$ ($1 \le t \le 100$). Description of the test cases follows.

The first line of each test case contains two integers $n$ and $k$ ($1 \leq n \leq 2 \cdot 10^5, 1 \leq k \leq 10^{18}$) – the length of your array and the number of operations to perform.

The second line of each test case contains $n$ integers $a_{1},a_{2},...,a_{n}$ $(-10^9 \leq a_{i} \leq 10^9)$ – the initial contents of your array.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 100$）。随后是各测试用例的描述。

每个测试用例的第一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 2 \cdot 10^5$，$1 \leq k \leq 10^{18}$）——分别表示数组的长度以及需要执行的操作次数。

每个测试用例的第二行包含 $n$ 个整数 $a_{1},a_{2},...,a_{n}$（$-10^9 \leq a_{i} \leq 10^9$）——表示数组的初始内容。

保证所有测试用例的 $n$ 之和不超过 $2 \cdot 10^5$。

For each case, print the final version of array $a$ after $k$ operations described above.

对于每组测试数据，输出执行上述 $k$ 次操作后数组 $a$ 的最终版本。

In the first test case the array changes as follows:

• Initially, the array is $[-199, 192]$. $d = 192$.

• After the operation, the array becomes $[d-(-199), d-192] = [391, 0]$.

在第一个测试用例中，数组的变化过程如下：

• 初始时，数组为 $[-199, 192]$，$d = 192$。

• 执行操作后，数组变为 $[d-(-199), d-192] = [391, 0]$。