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.

Let me give you an example: [1,45,67,43,58,98,41,34,57]
The answer to this example can be: [98,45,67,43,58,1,41,34,57]
Here is why: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

OK. solve this:
[23, 333, 423, 428, 337, 134, 388, 129, 293, 364, 92, 246, 275, 481, 361, 393, 375, 208, 279, 127]
Answer:
[481, 333, 423, 428, 337, 134, 388, 129, 293, 364, 92, 246, 275, 23, 361, 393, 375, 208, 279, 127]