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]: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]
[EX A]: [-63, 82, 79]

[EX Q]: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]
[EX A]: [98, -44, 98, 19, -1, 50, 98, -17, 48]

[EX Q]: [[-114, -108, 21, 75, -82, -191, 79], [-168, -22, -129, 69, -106, -146]]
[EX A]:
[79, 69]