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.

[EX Q]: [[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]]
[EX A]: [100, -120, -94, 63, 50, -139, 80, 56, 88]

[EX Q]: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]
[EX A]: [17, 69, 96, 75, 36, -151]

[EX Q]: [[-161, 54], [-41, 74], [74, 84, -87, 28, -181], [-44, 9, 40, -67, -193]]
[EX A]:
[54, 74, 84, 40]