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: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]

Answer: [100, -120, -94, 63, 50, -139, 80, 56, 88]


Question: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

Answer: [93, -100, 50, 56, 90, -87, 74, 82, 49]


Question: [[-190, 42, -16, -193], [8, -8, -198, -38, 78], [-29, -4, 79], [-134, 20, -92, 39, -123, -166, -163]]

Answer:
[42, 78, 79, 39]