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.

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

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


Input: Consider Input: [222, 187, 453, 396, 322, 161, 333, 308, 241, 460, 480, 252, 442, 343, 43, 80, 132, 316, 417, 269]

Output: [222, 187, 453, 396, 322, 161, 333, 308, 241, 460, 43, 252, 442, 343, 480, 80, 132, 316, 417, 269]


Input: Consider Input: [424, 356, 298, 311, 433, 419, 23, 69, 27, 499, 108, 140, 190, 442, 196, 383, 445, 93, 20, 490]


Output: [424, 356, 298, 311, 433, 419, 23, 69, 27, 20, 108, 140, 190, 442, 196, 383, 445, 93, 499, 490]