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: [68, 367, 282, 379, 289, 321, 305, 254, 426, 108, 287, 23, 402, 268, 461, 222, 24, 312, 144, 125]
Solution:
[68, 367, 282, 379, 289, 321, 305, 254, 426, 108, 287, 461, 402, 268, 23, 222, 24, 312, 144, 125]