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]: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]
[EX A]: [-55, 98, -27]

[EX Q]: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]
[EX A]: [79, 56, -1, 85, 89, 61, -62, 31]

[EX Q]: [[-31, -155, 42, 98, -42], [-26, 51, -23, -95, -31, -21, -91], [-57, -26, -188, 90, -176], [-144, -182, 63, 62, -157, -129, -77], [87, 3, 7, -7, 86], [93, -79]]
[EX A]:
[98, 51, 90, 63, 87, 93]