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: [[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]

A: [55, -15, 19, 99, 91, 85]
****
Q: [[-92, 66], [-124, -75, -170, -17, 20, -164]]

A: [66, 20]
****
Q: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

A:
[2, 72, 60]
****