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: [162, 27, 140, 274, 414, 376, 104, 159, 418, 155, 493, 151, 422, 335, 187, 292, 217, 31, 248, 84]
Output:
[162, 493, 140, 274, 414, 376, 104, 159, 418, 155, 27, 151, 422, 335, 187, 292, 217, 31, 248, 84]