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: [302, 130, 294, 366, 18, 311, 261, 263, 349, 160, 48, 323, 455, 177, 477, 384, 69, 377, 232, 107]
Solution:
[302, 130, 294, 366, 477, 311, 261, 263, 349, 160, 48, 323, 455, 177, 18, 384, 69, 377, 232, 107]