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.

[Q]: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]
[A]: [-93, 50, 32]


[Q]: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[A]: [-26, 0, 75]


[Q]: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
[A]:
[-7, 71, 29, 59, 93, 71]