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]: [25, 266, 227, 468, 309, 322, 381, 155, 271, 86, 284, 469, 108, 499, 389, 184, 464, 384, 198, 352]
[A]: [499, 266, 227, 468, 309, 322, 381, 155, 271, 86, 284, 469, 108, 25, 389, 184, 464, 384, 198, 352]


[Q]: [307, 396, 130, 427, 133, 98, 211, 373, 108, 445, 372, 386, 278, 200, 483, 264, 101, 114, 84, 44]
[A]: [307, 396, 130, 427, 133, 98, 211, 373, 108, 445, 372, 386, 278, 200, 44, 264, 101, 114, 84, 483]


[Q]: [64, 35, 266, 412, 289, 233, 485, 316, 384, 425, 129, 297, 105, 74, 353, 197, 473, 89, 164, 163]
[A]:
[64, 485, 266, 412, 289, 233, 35, 316, 384, 425, 129, 297, 105, 74, 353, 197, 473, 89, 164, 163]