I\'m trying to find the smallest of the biggest sum of each column of all the possible permutations of a given 2D array, where the positions of value in each row can move to
