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]: [[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]
[EX A]: [80, 88, 84, 99, 34]

[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]: [[-177, 67, -75, -129, -17], [-191, -198], [-181, -160, 63, 32], [-12, -190, -160], [91, 11, 63, -136], [-43, -167], [-62, -101, -54, -155], [-42, 1, -98, 90, 88, -169]]
[EX A]:
[67, -191, 63, -12, 91, -43, -54, 90]