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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

A: [95, 57, -144, 66, 54, 52, 93, 100, 21]
****
Q: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]

A: [12, -10, -48, -35]
****
Q: [[66, -197, -27, -83], [-131, -155, -44], [-30, -4, 6, 45, 5, -155], [-145, 37], [-50, -40, -45, 69, 86], [35, 15]]

A:
[66, -44, 45, 37, 86, 35]
****