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:
[120, 262, 66, 174, 202, 447, 193, 188, 307, 474, 69, 100, 338, 394, 487, 145, 348, 184, 358, 149]
Answer:
[120, 262, 487, 174, 202, 447, 193, 188, 307, 474, 69, 100, 338, 394, 66, 145, 348, 184, 358, 149]