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]: [[-4, 11], [12, -196, -120, 66, -157, -72]]
[A]: [11, 66]


[Q]: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]
[A]: [55, 21, 75, 84]


[Q]: [[-59, -138, 78], [99, -38, -189, -133, -140, 37, 33], [-77, -153, 30, -200], [-157, 71]]
[A]:
[78, 99, 30, 71]