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]: [[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]: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
[EX A]: [98, -11, 98, 26, 10]

[EX Q]: [[-102, -114, -98, -8], [8, 32], [-16, 58, -24, -181], [-199, 51, 38, 27, -48, -57, -143]]
[EX A]:
[-8, 32, 58, 51]