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: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]

A: [93, -40, -72, 13, 91, 35, 33, 28]
****
Q: [[-102, 46, -150, -150], [-151, -137]]

A: [46, -137]
****
Q: [[-158, -130, -65, -100, 75, -14, -165], [-33, -55, -20, -120, 33], [98, -159, -186, -135, -68, -135], [-118, 23]]

A:
[75, 33, 98, 23]
****