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: [265, 209, 433, 482, 412, 249, 19, 456, 256, 334, 50, 223, 458, 135, 65, 282, 309, 405, 274, 430]
Solution:
[265, 209, 433, 19, 412, 249, 482, 456, 256, 334, 50, 223, 458, 135, 65, 282, 309, 405, 274, 430]