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: [[57, -140, -88, -200, -81, 0], [-17, -81], [-64, -151, -32, -36, 58, 27, -86], [-142, -121, -92, 0, 53, -73], [-21, 51, -25], [63, 88, 25, 10], [-95, -148, 25, -161, -168, -76], [2, -111, -15, -79, 61], [-44, 12, -135, -7, 73, -84, -144]]

A: [57, -17, 58, 53, 51, 88, 25, 61, 73]
****
Q: [[78, -179], [-154, 26, -194, -39], [73, -154, 7, -158, 45]]

A: [78, 26, 73]
****
Q: [[2, -35, -76, -193, 13, -174], [-54, -71], [-174, -172, -95, -48], [-53, 28, -122, -159, -81, -199], [62, -91, 56, -189, -26, -16], [-62, 12, -115, -19, -110, 78]]

A:
[13, -54, -48, 28, 62, 78]
****