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: [262, 28, 30, 382, 287, 474, 413, 349, 356, 15, 202, 313, 86, 17, 204, 306, 229, 227, 247, 47]
Solution:
[262, 28, 30, 382, 287, 15, 413, 349, 356, 474, 202, 313, 86, 17, 204, 306, 229, 227, 247, 47]