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: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

A: [95, 60, 31, -122, 66, 84, 17]
****
Q: [[-140, -97], [-65, -182, 78, 58, -62, 65, -194], [-37, 10, -94, -121, 49], [90, 58, -103]]

A:
[-97, 78, 49, 90]
****