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: [170, 498, 490, 349, 135, 345, 287, 182, 394, 23, 97, 14, 418, 274, 285, 78, 147, 215, 104, 387]
Solution:
[170, 14, 490, 349, 135, 345, 287, 182, 394, 23, 97, 498, 418, 274, 285, 78, 147, 215, 104, 387]