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]: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
[EX A]: [-7, 71, 29, 59, 93, 71]

[EX Q]: [[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]
[EX A]: [97, 25, 45, 51, -113, -56, 41, -40, 74]

[EX Q]: [[11, -121, -199], [71, -135, 3, -110, 41, -200], [-88, -137, 39, -139, 49, 79, -44], [45, -75, -103, -8, 14, -110], [-186, 94, -186, -26, -115, -65], [54, -140, 15, -73, 16, 25], [-51, -69, -108, 75, 10, -96, -36]]
[EX A]:
[11, 71, 79, 45, 94, 54, 75]