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.

[Q]: [331, 491, 492, 19, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 493, 77, 476, 121, 32]
[A]: [331, 491, 492, 493, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 19, 77, 476, 121, 32]


[Q]: [31, 364, 162, 376, 36, 497, 64, 10, 403, 264, 166, 426, 308, 232, 95, 406, 33, 170, 40, 311]
[A]: [31, 364, 162, 376, 36, 10, 64, 497, 403, 264, 166, 426, 308, 232, 95, 406, 33, 170, 40, 311]


[Q]: [48, 373, 251, 432, 93, 83, 294, 360, 168, 78, 239, 107, 293, 396, 494, 171, 282, 120, 473, 474]
[A]:
[494, 373, 251, 432, 93, 83, 294, 360, 168, 78, 239, 107, 293, 396, 48, 171, 282, 120, 473, 474]


