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]: [[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]
[A]: [-6, 51, 71, 98, -30, 26]


[Q]: [[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]
[A]: [45, 86, 75]


[Q]: [[95, -167, -160, -104], [6, 37, -36], [-111, 35, 16, 65, -95, -114]]
[A]:
[95, 37, 65]