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]: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
[EX A]: [66, 16, 16, 69, 12, 80]

[EX Q]: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]
[EX A]: [64, 19, 84, 40, 78]

[EX Q]: [[28, -188, -167, 42, -25], [25, -59], [87, -159, -164, 33, 49, -2]]
[EX A]:
[42, 25, 87]