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]: [[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
[EX A]: [47, 58, 99, -57, 92, -77, 30, 0, -38]

[EX Q]: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]
[EX A]: [49, 79, 8, 70]

[EX Q]: [[19, -168], [-43, -84], [67, 5, 87], [-175, -77, -47, 76, -138]]
[EX A]:
[19, -43, 87, 76]