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: [[-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: [[-56, 84, -91, -184, 7, 29, -135], [48, 90, 33], [46, 91, -59], [3, -92, -89, -112, -125, -169]]

A: [84, 90, 91, 3]
****
Q: [[-10, -114, -186, -64], [-27, -132, -99, -32], [-147, -166, -184, -147]]

A:
[-10, -27, -147]
****