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]: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
[EX A]: [97, 90, 93, 52, 52, -29, 37, 79, 80]

[EX Q]: [[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]
[EX A]: [61, 17]

[EX Q]: [[55, -62, 36, -75, 58, 3], [-131, -195, -110, -104, -16], [-124, 36, -141, 0, -148, -67, -94], [-85, 61], [-86, -134, -171, -125, 92, 92, -93], [-48, -176, 48, -191, -184, -62, 61], [-36, -164, 66, -126], [-28, 89, -34, -130, -199, -143, -102], [-124, 0, -179, -162, 15]]
[EX A]:
[58, -16, 36, 61, 92, 61, 66, 89, 15]