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]: [[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
[EX A]: [86, 76, -100, 99, 27, -48]

[EX Q]: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]
[EX A]: [90, 98, 22, 85, 64, 77, 63, -152]

[EX Q]: [[-28, 11, -86, 98, 70, -117, -111], [-88, -149, 21, 59, 19, 53, -92], [51, 100], [76, -129, -64], [-178, -74, 6, -32], [-199, -177, 88, -155, 85, -77, -80], [-86, -193, -169, 81], [-58, 44]]
[EX A]:
[98, 59, 100, 76, 6, 88, 81, 44]