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]: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[EX A]: [-26, 0, 75]

[EX Q]: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
[EX A]: [90, 65, 16, 93, 30]

[EX Q]: [[-144, -41, 39, -51, -96], [-177, -94, -162], [89, -173], [-12, -162, -127, -148, 56, -96], [-111, -180, 58], [85, -127, -185, 98, -125], [-190, 18], [-128, -12], [38, 50, 76, -10, -105, -57]]
[EX A]:
[39, -94, 89, 56, 58, 98, 18, -12, 76]