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]: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
[A]: [99, 32]


[Q]: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[A]: [96, 48, 65, 19, -26, 95, -11]


[Q]: [[-23, 45, -107, 63, -36], [-125, 58], [-50, 83], [-49, -89, 50, -177, -113, -196], [-48, -11, -156, 23, -153, -128, -84], [-77, -2, -80, -158], [68, -155, -73, -66]]
[A]:
[63, 58, 83, 50, 23, -2, 68]