You are given sum and n. You need to return the smallest lexicography permutation, that includes 1 to n, where each can be plus/minus, and their sum is equal to sum.
The permutation needs to be lexicography sorted as well.
For example: n=5, sum=9.
Permutations: [-1,-2,3,4,5], [1,2,-3,4,5]..
Each sorted: [-2,-1,3,4,5], [-3,1,2,4,5]..
Then return the smallest lexi out of all: [-3,1,2,4,5]