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: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]

A: [-122, 85, 30, 49, -75, 68, 72]
****
Q: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]

A: [-61, -68, -103, 97]
****
Q: [[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]

A:
[-41, 13, 43, 88, 15, 32, 33, 57]
****