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: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

A: [-42, 88, 91, -13, 34]
****
Q: [[82, -5, -106, 4], [92, -200, -78], [-93, -181, 63, 63], [15, -137, 27, -139], [-155, -26, -164, -24], [-98, -91, -127], [-127, -21, 47, 19, -190, 44]]

A: [82, 92, 63, 27, -24, -91, 47]
****
Q: [[19, -59, 98, 69, -112], [-185, -192], [-174, -105, -48, 72, 32], [6, 74], [-21, -29, -17], [61, 3], [-154, 100, 80, -76, -125, -168, -185], [-85, -86, -122, -26], [-8, -10, -72, -132]]

A:
[98, -185, 72, 74, -17, 61, 100, -26, -8]
****