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: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]

A: [98, 79, 97, 65, 71, 43, -72]
****
Q: [[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]

A: [-35, 73, 58, 72]
****
Q: [[22, -143, -57, 16], [-8, -157, 41, -14, 32, -120], [-59, -61, 90, -32], [39, -35, -29, 72, 47, -82, -159], [74, -88], [-95, -198, 2], [-80, -64, -40], [21, 38]]

A:
[22, 41, 90, 72, 74, 2, -40, 38]
****