Roman has no idea, why this problem is called Stone. He also has no idea on how to solve the followong problem: given array of N integers A and a number K. During a turn the maximal value over all Ai is chosen, let's call it MAX. Then Ai = 
MAX - Ai is done for every 1 <= i <= N. Help Roman to find out how will the array look like after K turns.
-----Input-----
The numbers N and K are given in the first line of an input. Then N integers are given in the second line which denote the array A. 
-----Output-----
Output N numbers on a single line. It should be the array A after K turns.
-----Constraints-----
- 1 <= N <= 105
- 0 <= K <= 109
- Ai does not exceed 2 * 109 by it's absolute value.
-----Example-----
Input:
4 1
5 -1 7 0
Output:
2 8 0 7
def Turn(a, n):
 m = max(a)
 for i in range(n):
  a[i] = m - a[i]

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k > 0:
 Turn(a, n)
 k -= 1
 if k & 1 == 1:
  Turn(a, n)
print(' '.join(map(str,a)))

def Turn(a, n):
 m = max(a)
 for i in range(n):
  a[i] = m - a[i]

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k > 0:
 Turn(a, n)
 k -= 1
 if k & 1 == 1:
  Turn(a, n)
print(' '.join(map(str,a)))
