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, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]

A: [52, 76, 70, 93, 26, 99, 12, 94]
****
Q: [[-129, -155], [-197, -113, -8, -126, -172], [85, -141, -164, -98, 36]]

A: [-129, -8, 85]
****
Q: [[-174, -16, -42], [88, -98, -180, 14], [-51, -76, 10, -109, 5, -26], [-51, -166, -63], [-55, 30, 86, -105, 83], [-143, 93], [-192, -53], [-126, -145, -161, 84, 42]]

A:
[-16, 88, 10, -51, 86, 93, -53, 84]
****