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: [314, 122, 249, 424, 38, 90, 272, 426, 97, 476, 491, 340, 312, 34, 311, 405, 438, 433, 301, 206]
Output:
[314, 122, 249, 424, 38, 90, 272, 426, 97, 476, 34, 340, 312, 491, 311, 405, 438, 433, 301, 206]