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: [[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]

A: [92, 29, -2]
****
Q: [[-141, -169, 22, 54, -196, 97, -40], [-160, -162, 51], [-44, -105], [69, -156, -175, 14], [59, -91, -52, -100], [-196, -163, -81, 71, -136], [79, -160], [-144, -179, -101], [-187, 20, -19, -148, 87]]

A:
[97, 51, -44, 69, 59, 71, 79, -101, 87]
****