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]: [[77, -10], [-44, 22, -89], [83, -197, -135], [94, 7, -166, -111]]
[A]: [77, 22, 83, 94]


[Q]: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]
[A]: [23, 99, 54, 29, 98, 95, 65, 88, 51]


[Q]: [[-39, -105, -79, 84, -91, -17], [-68, -89], [-94, -155, 73, -42, 83, -122, -53], [12, -70, 93, 71, 95], [-154, -61, -176, -195, 0, -105], [2, -98, 75, 32, -156, -166], [84, -57, 74, 72, 8, 48, -5], [1, -156, -164, 47, -52, -15, -131], [-145, -139, -54]]
[A]:
[84, -68, 83, 95, 0, 75, 84, 47, -54]