Roma works in a company that sells TVs. Now he has to prepare a report for the last year.

Roma has got a list of the company's incomes. The list is a sequence that consists of *n* integers. The total income of the company is the sum of all integers in sequence. Roma decided to perform exactly *k* changes of signs of several numbers in the sequence. He can also change the sign of a number one, two or more times.

The operation of changing a number's sign is the operation of multiplying this number by -1.

Help Roma perform the changes so as to make the total income of the company (the sum of numbers in the resulting sequence) maximum. Note that Roma should perform exactly *k* changes.
The first line contains two integers *n* and *k* (1 ≤ *n*, *k* ≤ 10<sup class="upper-index">5</sup>), showing, how many numbers are in the sequence and how many swaps are to be made.

The second line contains a non-decreasing sequence, consisting of *n* integers *a*<sub class="lower-index">*i*</sub> (|*a*<sub class="lower-index">*i*</sub>| ≤ 10<sup class="upper-index">4</sup>).

The numbers in the lines are separated by single spaces. Please note that the given sequence is sorted in non-decreasing order.
def findIncome(arr , flag , k , index):
        if flag == -2:
                subArr = [i * -1 for i in arr[:index]]
                k -= index
                temp = [arr[index] * ((-1) ** k)]
                arr = subArr + temp + arr[index + 1:]
                return sum(arr)
        elif flag == -1:
                subArr = [i * -1 for i in arr[:index]]
                arr = subArr + arr[index:]
                return sum(arr)
        else:
                subArr = [i * -1 for i in arr[:k]]
                arr = subArr + arr[k:]
                return sum(arr)

if __name__ == "__main__":
        temp = list(map(int , input().rstrip().split()))
        index = -1
        n = temp[0]
        k = temp[1]
        
        arr = list(map(int , input().rstrip().split()))
        flag = 0
        if 0 in arr and arr.index(0) < k - 1:
                index = arr.index(0)
                flag = -1
                
        if k <= n and arr[k - 1] > 0 and flag == 0:
                for i in range(k):
                        if arr[i] > 0:
                                index = i
                                break
                flag = -2

        if k > n and flag == 0:
                temp = n
                if arr[temp - 1] > 0 and flag == 0:
                        for i in range(temp):
                                if arr[i] > 0:
                                        index = i
                                        break
                        flag = -2

        print (findIncome(arr , flag , k , index))
