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: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

A: [-6, -59, 52, 14, 96, 37, 62]
****
Q: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]

A: [86, 23, 78, 68, -116, 72, 55, 53]
****
Q: [[-130, -166, 82, 97, -95, -179], [43, -155, -178, -14], [-105, 38, 46, 42, -82, -41, 52]]

A:
[97, 43, 52]
****