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]: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]
[EX A]: [77, 81, 85, 93, 54, 88]

[EX Q]: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]
[EX A]: [-15, 88, -15, -85]

[EX Q]: [[50, -57, -124, -137, -135], [-149, -114, 11, -159], [-108, -102, 62, 24, 65, 7, -111], [100, -167, -74], [31, -102, -108], [92, -171, -103, 41], [56, -43, 21], [56, -29, -6, -26, 96], [13, -92, -25, -162]]
[EX A]:
[50, 11, 65, 100, 31, 92, 56, 96, 13]