Given the task definition and input, reply with output. 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.

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

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