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: [352, 19, 343, 202, 392, 372, 496, 393, 355, 178, 310, 399, 183, 281, 425, 62, 76, 82, 438, 249]
Output:
[352, 496, 343, 202, 392, 372, 19, 393, 355, 178, 310, 399, 183, 281, 425, 62, 76, 82, 438, 249]