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: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

A: [57, 80, -20, -50, 8, 64]
****
Q: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

A: [79, 65, -87, 89, -2, -13, 20, -184]
****
Q: [[-152, -28], [24, -72, -82, 64, 95], [-52, -196, -38, 21, -12], [-17, -101, -62], [79, -194, -125], [-34, 40, 17, -81, 74, -128, -163], [-42, -126, 55, 76, -53], [52, 3, -66, 85], [51, -129, -139, -178]]

A:
[-28, 95, 21, -17, 79, 74, 76, 85, 51]
****