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: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

A: [90, -12, 100, 6]
****
Q: [[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]

A: [-68, 75, -10, 55, 89, 94, 52, 22, 96]
****
Q: [[-70, -165, 21, 38, -81], [-24, -186, -31, -25, -60]]

A:
[38, -24]
****