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]: [[-72, 58], [-110, -110, 92, -58, -181, -159, 35], [-12, 67, -22, -15, -8, -190], [-163, -166, -128, -150, 70, 54]]
[EX A]: [58, 92, 67, 70]

[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]: [[-31, -130, 27], [17, -198, 66, -17], [-99, 92], [87, 74, 80, -181], [-144, -3, 42, -146, -125, -56, -20], [-10, -197, -192, 87, 8, -185, -51]]
[EX A]:
[27, 66, 92, 87, 42, 87]