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]: [[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]
[EX A]: [89, 85, 85, 1]

[EX Q]: [[-95, 0, -192, 42, -97, -175, 46], [-35, -75, 40, 81], [8, 80, -20, -159, -36, -128, 96], [3, -193], [-35, -13, -69, -2], [11, 89, -183, -49], [-67, -184], [-164, -183, -107, 77]]
[EX A]: [46, 81, 96, 3, -2, 89, -67, 77]

[EX Q]: [[-171, 70, 8], [-20, -197, 45, -193], [10, 57, 96], [-141, 10, -180, -150, -190, 26], [85, -10, -66, -12, 2, 83, 62], [-79, -152], [-55, 78, -154]]
[EX A]:
[70, 45, 96, 26, 85, -79, 78]