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
m=map(int,raw_input().split())
n=m[0]
k=m[1]
arr=map(int,raw_input().split())
arr2=[]
arr1=[]
ans=""
ma=max(arr)
for i in xrange(0,n):
    arr1.append(ma-arr[i])
ma=max(arr1)
#print "ma1",ma
for i in xrange(0,n):
    arr2.append(ma-arr1[i])
#print arr,arr1,arr2
ans=""
if k!=0:
    if k%2==0:
	for i in xrange(0,n):
	    ans+=str(arr2[i])+" "
    else:
	for i in xrange(0,n):
	    ans+=str(arr1[i])+" "
else:
    for i in xrange(0,n):
	ans+=str(arr[i])+" "
    ans
print ans