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]: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]
[EX A]: [75, 57, 75, 20, -95, 20]

[EX Q]: [[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]
[EX A]: [-61, -151, 63, -48, 2, 66]

[EX Q]: [[-46, -80, 13, -108, -51], [18, -186, -145, 14], [-176, -103, -69, -153]]
[EX A]:
[13, 18, -69]