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: [[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

A: [38, 25, -7, 1, 40, 92, 87, 76, -95]
****
Q: [[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]

A: [93, 17, 78, 84, 35]
****
Q: [[-86, -68], [41, -41, -129, 34, -200, 39], [55, -16], [-68, 40, 82]]

A:
[-68, 41, 55, 82]
****