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]: [[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]
[EX A]: [33, 100, 74, 69]

[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]: [[43, 21, -198, -56], [-116, 68, -80], [-68, 16, -41, 9, 99, -193], [-66, -3], [-162, -42, -86, -7], [-91, 100, -133, 26], [-122, -7, -199], [-5, -139, -74, -147, -182]]
[EX A]:
[43, 68, 99, -3, -7, 100, -7, -5]