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]: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]
[EX A]: [74, 78, -132, 63, 73, 39]

[EX Q]: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
[EX A]: [58, 19, 68]

[EX Q]: [[42, -198, 94, -18], [67, 11], [30, -1, 95], [-32, -58, -77, -195], [-156, -117, -115, 25, -160, -163], [-171, 22, -136, -60, -116], [46, -176, -89, 70, -12], [54, -29, -69, -173, -180, -63, -155], [-199, -79, 15, -152, 3]]
[EX A]:
[94, 67, 95, -32, 25, 22, 70, 54, 15]