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]: [[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]
[EX A]: [81, 67, 86, 59, 75]

[EX Q]: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[EX A]: [55, 64, 56, -31, -4, 51]

[EX Q]: [[-18, -111, 16, 87], [95, 26, -46, -180, -196], [-24, 71, -173, 82, -108], [-179, -73, -76, -78, -198]]
[EX A]:
[87, 95, 82, -73]