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]: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]
[EX A]: [97, -35, 7]

[EX Q]: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
[EX A]: [-7, 71, 29, 59, 93, 71]

[EX Q]: [[-70, 100, -62, 66, 70, -43], [-31, -98, -25], [-174, -165, -97, 35, -69, -92], [2, -186, -142, -148, -64], [-143, 33], [-26, -141, 70], [-71, -118, -133, -74]]
[EX A]:
[100, -25, 35, 2, 33, 70, -71]