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:
[137, 404, 334, 99, 264, 444, 439, 348, 488, 402, 475, 436, 163, 98, 19, 132, 432, 292, 338, 464]
Answer:
[137, 404, 334, 99, 264, 444, 439, 348, 19, 402, 475, 436, 163, 98, 488, 132, 432, 292, 338, 464]