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: [[-31, -48], [7, -142, -76]]

A: [-31, 7]
****
Q: [[72, -17], [74, -10, -126], [-3, -103, 31, 48, -149, 39], [100, -121, 100, 93, 2], [0, -69, -52, -192], [-67, 83, -86, -193, 92, 51], [75, -114, -15, -150, -178, 17, -53], [99, -135, -34, -172, -145, -50], [-126, -187, 42, 31, 50]]

A:
[72, 74, 48, 100, 0, 92, 75, 99, 50]
****