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: [83, 244, 378, 130, 291, 190, 199, 474, 112, 225, 109, 450, 228, 439, 143, 227, 394, 47, 203, 246]
Solution:
[83, 244, 378, 130, 291, 190, 199, 47, 112, 225, 109, 450, 228, 439, 143, 227, 394, 474, 203, 246]