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]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[EX A]: [-61, -68, -103, 97]

[EX Q]: [[82, -5, -106, 4], [92, -200, -78], [-93, -181, 63, 63], [15, -137, 27, -139], [-155, -26, -164, -24], [-98, -91, -127], [-127, -21, 47, 19, -190, 44]]
[EX A]: [82, 92, 63, 27, -24, -91, 47]

[EX Q]: [[-157, 10, -26, -140, 36, -40], [55, -59]]
[EX A]:
[36, 55]