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]: [[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]
[EX A]: [84, 66, 12, 62, 32]

[EX Q]: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]
[EX A]: [60, -36, 94, 68, 36, -64, 41]

[EX Q]: [[-40, -20], [53, -46, -106], [-87, -25], [-119, -127], [51, -56, -124], [43, -40, -128, 70, -107, -144]]
[EX A]:
[-20, 53, -25, -119, 51, 70]