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]: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
[EX A]: [66, 16, 16, 69, 12, 80]

[EX Q]: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
[EX A]: [79, -33, 2, 42, 81, -142, 71]

[EX Q]: [[-80, -32, -112, -149], [-140, -169, 91, -168, -163, -56], [-4, 7, 42, 65, 28, 41, -168], [90, -163, -23, -92], [-130, 72, 59], [-14, -62], [-171, 0, -39], [-53, -163, 10]]
[EX A]:
[-32, 91, 65, 90, 72, -14, 0, 10]