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]: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]
[EX A]: [-18, 95, 50, 81, 49, 91, 94, 59]

[EX Q]: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]
[EX A]: [22, 9, -80, 65]

[EX Q]: [[-38, -167, -153, -136], [-113, 100], [93, -147, -179, -189, 10, 43, 90], [86, -12, -126, 88, 92, -87, -195], [-49, -160, -4, 35, 68, -200, -167], [-179, -179, -19, 59, -83, -99, -167]]
[EX A]:
[-38, 100, 93, 92, 68, 59]