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


[Q]: [[-62, 3, -118, -146, 75, -150], [3, -126, 64, -23], [64, 28], [-90, 57, 97, -92, -179]]
[A]: [75, 64, 64, 97]


[Q]: [[-113, 83, -170, -39, -96, 41, -162], [74, -96, -29, -16], [-68, -25, -123], [-105, 30, 36, 46, -44], [-143, -182, 18, -87], [-144, 66, 46, -79, -198, -125, -182], [33, -91, -2, -198], [-16, -40, -167], [26, 72, -168, -157, -158, -118, 44]]
[A]:
[83, 74, -25, 46, 18, 66, 33, -16, 72]