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:
[66, 42, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 496, 199, 68, 415, 364, 88, 491, 465]
Answer:
[66, 496, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 42, 199, 68, 415, 364, 88, 491, 465]