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: [[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]

A: [47, 58, 99, -57, 92, -77, 30, 0, -38]
****
Q: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

A: [-55, 98, -27]
****
Q: [[-180, -143, -111, 22], [-14, -155, -62, -172, 31, -136, 50]]

A:
[22, 50]
****