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: [261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 19, 267, 111, 206, 257, 107, 461, 174]

Output: [261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 461, 267, 111, 206, 257, 107, 19, 174]


Input: Consider Input: [258, 62, 343, 490, 233, 496, 293, 255, 271, 334, 398, 184, 217, 305, 246, 416, 261, 118, 241, 260]

Output: [258, 496, 343, 490, 233, 62, 293, 255, 271, 334, 398, 184, 217, 305, 246, 416, 261, 118, 241, 260]


Input: Consider Input: [60, 83, 17, 71, 59, 325, 38, 236, 206, 52, 25, 399, 177, 386, 180, 123, 466, 366, 444, 237]


Output: [60, 83, 466, 71, 59, 325, 38, 236, 206, 52, 25, 399, 177, 386, 180, 123, 17, 366, 444, 237]