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]: [[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]
[EX A]: [-7, 1, 54, 9, -14, 94, 14, -83]

[EX Q]: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[EX A]: [96, 48, 65, 19, -26, 95, -11]

[EX Q]: [[-98, -52, -176, -90, -133, -171], [53, -21, -199, -21, -135, 86], [-38, -98, -77, -68], [-106, -135], [-115, 66, -57, 55, -21, 76, 28], [-109, 75, -111, -130, -111, 62], [-123, -37, 89, -21, -118, -149]]
[EX A]:
[-52, 86, -38, -106, 76, 75, 89]