You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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.

[1,45,67,43,58,98,41,34,57]
Solution: [98,45,67,43,58,1,41,34,57]
Why? 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input: [331, 491, 492, 19, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 493, 77, 476, 121, 32]
Solution:
[331, 491, 492, 493, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 19, 77, 476, 121, 32]