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]: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
[EX A]: [91, -49, 89, 83, 92, -91]

[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]: [[-60, -33], [-47, -105, -57, 74, -50, -156, -70], [30, -85], [-116, -78, 28, -11, -70, 96, 85], [-34, -163], [-55, -189, 41, 9, -53], [-10, 66, 87, 0, -1, 33], [-121, -150, 4, -66, -132]]
[EX A]:
[-33, 74, 30, 96, -34, 41, 87, 4]