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: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]

A: [54, 44, 50, 12, 24, -28]
****
Q: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

A: [91, 53, 82, -9]
****
Q: [[-193, -173, -81, -3, -126], [-71, -123, -103, 55, -7, -196, 85], [-84, -56, -156, 44, -161], [-16, 63, -145, -110, 46, -131, -179], [13, 75, -98]]

A:
[-3, 85, 44, 63, 75]
****