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]: [[89, 48, 81, 67, 22, 14], [-78, 84]]
[EX A]: [89, 84]

[EX Q]: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]
[EX A]: [91, -17, 64, 81, 54, 100]

[EX Q]: [[-30, 10, 94, -95, 21], [-101, 71, -126, -150, -12, -100], [-176, -136, 50, 73, -199, -151, -62], [-24, 65, -9, -150, -171], [2, -145, -45, 84, -163, -27, -116], [38, -47, -134, 73, -32], [-128, -14, -169, -136], [5, -181, 48, -108, -199, -200]]
[EX A]:
[94, 71, 73, 65, 84, 73, -14, 48]