Given the task definition, example input & output, solve the new input case.
In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.
Example: [1,45,67,43,58,98,41,34,57]
Output: [98,45,67,43,58,1,41,34,57]
1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input case for you: [114, 363, 306, 103, 146, 131, 217, 420, 350, 66, 195, 442, 313, 153, 235, 18, 127, 204, 247, 291]
Output:
[114, 363, 306, 103, 146, 131, 217, 420, 350, 66, 195, 18, 313, 153, 235, 442, 127, 204, 247, 291]