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]: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[EX A]: [-26, 0, 75]

[EX Q]: [[-69, 68, -10], [-181, 60, -71, -42, -34], [49, -38, -173, 97, -106, -91, -87], [-112, -18, -84, -112, 40, -52, -106], [-199, -95, -67, -60, -183, 91], [-164, 44, -76, -168, -152, 80, -160]]
[EX A]:
[68, 60, 97, 40, 91, 80]