In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
--------
Question: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]

Answer: [0, 22, 17, 48, 80]


Question: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]

Answer: [43, -1, 40, 80, 73]


Question: [[48, -95, -125, 0, -14, -3, -124], [98, -70, -64, -151, 21, -91], [-26, -20, -93, -181, -161, -146], [-11, 88, 1], [-93, -133, -111, -72, -42], [30, -183, -151], [-9, -30, -59, -178, -14, 9, 44], [-167, -119, 27, -160], [-72, -33, 41, 93]]

Answer:
[48, 98, -20, 88, -42, 30, 44, 27, 93]