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: [53, 400, 447, 274, 435, 432, 46, 51, 317, 404, 442, 16, 70, 190, 449, 43, 356, 156, 175, 294]
Solution:
[53, 400, 447, 274, 435, 432, 46, 51, 317, 404, 442, 449, 70, 190, 16, 43, 356, 156, 175, 294]