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: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]

A: [23, 99, 54, 29, 98, 95, 65, 88, 51]
****
Q: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]

A: [-111, 83, -8, 92, 55, 91, 70]
****
Q: [[-125, -3, 77, 64, -144, -98], [-77, -46, 5, -132, -140, -81], [38, 20, -169], [83, 3, -6, -15], [-52, -96, -84, 33], [-162, 30, -193], [-107, -186, -48]]

A:
[77, 5, 38, 83, 33, 30, -48]
****