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]: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
[A]: [54, 44, 50, 12, 24, -28]


[Q]: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]
[A]: [49, 79, 8, 70]


[Q]: [[-187, -4, -31, -157, -105, 39], [-68, 56, -150, 68], [-86, 36, -159, -95], [-144, -86]]
[A]:
[39, 68, 36, -86]