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]: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]
[A]: [95, 57, -144, 66, 54, 52, 93, 100, 21]


[Q]: [[-54, 44, 83, -159], [-121, -81], [-49, -186], [61, -20], [97, -128], [0, -50, 29, -154, -159, 40, -68], [-30, 77, -132, -155, -1, -90]]
[A]: [83, -81, -49, 61, 97, 40, 77]


[Q]: [[-141, 4], [-179, -187, -141, -14, -31, 83, -2], [3, -173, -59, -198, -189, -180], [-186, -1, -63, 18, -186]]
[A]:
[4, 83, 3, 18]