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]: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[EX A]: [12, -10, -48, -35]

[EX Q]: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]
[EX A]: [64, 55, 92, 95, 72, -29, 63]

[EX Q]: [[49, -170, -37, -71, 40, -166, 54], [-47, -135, 96, 26, 0, -111, 58], [-7, -183, -29, -87], [99, 69, -177], [-130, -128, -195, 76, -130], [70, -197, -147, -55, -10, -26], [-63, 33, -128], [4, -166, -163], [-147, -138, 75, 29]]
[EX A]:
[54, 96, -7, 99, 76, 70, 33, 4, 75]