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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

A: [-55, 98, -27]
****
Q: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

A: [75, 51, 10, 53, -43, 17, -111]
****
Q: [[66, -88], [18, -95, 13, 65], [26, -158, -29, 71, -65], [-98, 86, -188, -43, -172, -93, -23], [-125, 11, -92, -59, 66, -59, -93], [-57, 55, -61]]

A:
[66, 65, 71, 86, 66, 55]
****