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]: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
[EX A]: [89, 96, -69, 40, 90, 75, 99, 98, 41]

[EX Q]: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
[EX A]: [98, -11, 98, 26, 10]

[EX Q]: [[-162, -196, 35, -175, -87], [59, 12, -152, -96], [-171, 38, -50, -56], [-166, 64, 22, -33, -85, -137, 27], [82, 36, 31, 85, -2]]
[EX A]:
[35, 59, 38, 64, 85]