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: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]

Answer: [63, -33, 43, 68]


Question: [[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]

Answer: [84, 66, 12, 62, 32]


Question: [[31, 36], [43, 64, -8, 79, -49], [13, 51], [-152, -101, -15, 15, -147, -78, -168], [91, -71, -56, 62, -66, -4], [30, 32, -70, 90, -182]]

Answer:
[36, 79, 51, 15, 91, 90]