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]: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]
[A]: [91, -17, 64, 81, 54, 100]


[Q]: [[-107, 41, 2, -56, -164, -190], [-61, -10]]
[A]: [41, -10]


[Q]: [[33, -77, 87, 17, 24], [-24, -21, -150, -188, -86]]
[A]:
[87, -21]