Given an integer array nums and an integer k, perform exactly k sign reversals on elements of the array. Each reversal toggles one element from positive to negative or negative to positive. Return the maximum possible sum of the array after all reversals.
