rrstone_28516
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 <= 10^5
0 <= K <= 10^9
Ai does not exceed 2 * 10^9 by it's absolute value.


Example
Input:
4 1
5 -1 7 0

Output:
2 8 0 7
fr=raw_input().split()
n=int(fr[0])
k=int(fr[1])
raw=raw_input().split()
l=[]

for i in range(0,n):
	l.append(int(raw[i]))

if k==0:
	for i in l:
		print i,
	print ""

me=max(l)
for i in range(0,n):
	l[i]=me-l[i]
if k%2==1:
	for i in l:
		print i,
	print ""

if k%2==0 and k!=0:
	me=max(l)
	for i in range(0,n):
		l[i]=me-l[i]
		print l[i],
	print ""
4 1
5 -1 7 0 4 1
5 -1 7 1 4 1
5 -1 7 2 4 0
5 -1 7 2 4 0
5 -1 7 4 4 0
5 -1 7 0 4 0
5 -1 10 0 4 0
5 -1 13 0 4 1
5 0 7 0 4 1
5 0 7 1 4 1
5 -1 7 4 4 1
9 -1 7 2 4 0
5 -1 5 0 4 0
5 -1 14 0 4 2
5 0 7 1 4 1
5 -2 7 1 4 1
1 -1 7 4 4 2
9 -1 7 2 4 0
4 -1 5 0 4 0
5 -1 15 0 4 2
5 0 7 0 4 1
4 -2 7 1 4 1
1 -1 13 4 4 0
2 -1 5 0 4 2
5 -1 7 0 4 1
4 -1 7 1 4 1
1 -1 19 4 4 0
2 0 5 0 4 2
5 -1 4 0 4 1
4 -1 0 1 4 3
5 -2 7 2 4 0
2 0 5 -1 4 2
10 -1 4 0 4 1
4 0 0 1 4 1
4 0 1 1 4 4
5 -2 7 2 4 1
4 1 1 1 4 4
5 -1 7 2 4 1
1 1 1 1 4 1
1 2 1 1 4 0
1 2 1 1 4 1
0 -1 7 0 4 1
5 -1 13 0 4 0
5 -1 12 2 4 0
5 -1 9 0 4 0
5 -1 1 0 4 0
5 -2 13 0 4 1
5 0 14 0 4 1
5 -2 7 4 4 1
0 -1 7 2 4 0
5 -1 14 -1 4 1
5 -3 7 1 4 1
1 -2 7 4 4 3
9 -1 7 1 4 0
4 -1 5 -1 4 0
5 -1 12 0 4 1
4 -2 7 2 4 1
4 -1 7 2 4 2
1 -1 19 4 4 0
2 0 9 0 4 1
4 -1 0 2 4 3
2 -2 7 2 4 0
2 -1 5 -1 4 2
10 0 4 0 4 1
4 1 0 1 4 4
5 -2 12 2 4 1
4 1 1 2 4 1
1 1 1 2 4 1
1 4 1 1 4 0
0 2 1 1 4 1
1 -1 7 0 4 1
5 -1 15 0 4 0
7 -1 12 2 4 0
5 0 9 0 4 0
5 -1 1 1 4 1
5 0 14 -1 4 1
5 -2 7 8 4 1
-1 -1 7 2 4 0
6 -1 14 -1 4 1
1 -3 7 1 4 1
1 -2 7 1 4 3
9 0 7 1 4 0
4 -1 7 -1 4 0
5 -1 19 0 4 4
4 0 7 0 4 0
4 -1 7 2 4 2
1 -1 19 7 4 2
4 -1 0 2 4 3
0 -2 7 2 4 2
10 0 6 0 4 1
4 1 0 0 4 5
5 -2 14 1 4 4
5 -2 0 2 4 1
1 1 2 2 4 1
1 -1 7 -1 4 1
5 -1 23 0 4 0
7 0 12 2 4 0
5 0 10 0 4 0
5 -1 0 1 4 1
3 0 14 -1 4 1
5 -2 7 11
2 8 0 7
 2 8 0 6
 2 8 0 5
 5 -1 7 2
 5 -1 7 4
 5 -1 7 0
 5 -1 10 0
 5 -1 13 0
 2 7 0 7
 2 7 0 6
 2 8 0 3
 0 10 2 7
 5 -1 5 0
 5 -1 14 0
 5 0 7 1
 2 9 0 6
 6 8 0 3
 10 0 8 3
 4 -1 5 0
 5 -1 15 0
 5 0 7 0
 3 9 0 6
 12 14 0 9
 2 -1 5 0
 6 0 8 1
 3 8 0 6
 18 20 0 15
 2 0 5 0
 6 0 5 1
 0 5 4 3
 2 9 0 5
 2 0 5 -1
 11 0 5 1
 0 4 4 3
 0 4 3 3
 7 0 9 4
 0 3 3 3
 6 0 8 3
 0 0 0 0
 1 0 1 1
 1 2 1 1
 7 8 0 7
 8 14 0 13
 5 -1 12 2
 5 -1 9 0
 5 -1 1 0
 5 -2 13 0
 9 14 0 14
 2 9 0 3
 7 8 0 5
 5 -1 14 -1
 2 10 0 6
 6 9 0 3
 0 10 2 8
 4 -1 5 -1
 5 -1 12 0
 3 9 0 5
 3 8 0 5
 2 0 20 5
 2 0 9 0
 0 5 4 2
 5 9 0 5
 2 -1 5 -1
 10 0 4 0
 0 3 4 3
 7 0 14 4
 0 3 3 2
 1 1 1 0
 3 0 3 3
 0 2 1 1
 6 8 0 7
 10 16 0 15
 7 -1 12 2
 5 0 9 0
 5 -1 1 1
 9 14 0 15
 3 10 1 0
 8 8 0 5
 6 -1 14 -1
 6 10 0 6
 6 9 0 6
 0 9 2 8
 4 -1 7 -1
 5 -1 19 0
 4 0 7 0
 4 -1 7 2
 2 0 20 8
 5 0 1 3
 7 9 0 5
 10 0 6 0
 0 3 4 4
 9 16 0 13
 7 0 2 4
 1 1 0 0
 6 8 0 8
 18 24 0 23
 7 0 12 2
 5 0 10 0
 5 -1 0 1
 11 14 0 15
 6 13 4 0
