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]: [[-36, -152, -104, -52, 52, 6], [90, -19, -71, -183, -183, -15, -153]]
[EX A]: [52, 90]

[EX Q]: [[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]
[EX A]: [-68, 75, -10, 55, 89, 94, 52, 22, 96]

[EX Q]: [[45, -143, -71, -125, -85, -138, 48], [-153, -149, 58, -25]]
[EX A]:
[48, 58]