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: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

A: [90, -12, 100, 6]
****
Q: [[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]

A: [-2, 31, 57, 0, 55, 94, 49, 57, 9]
****
Q: [[-15, 57, 23, 92], [0, -20, -52, -160], [-199, 84, -142, 93, -174, 85], [-124, 72, -125, -152, -183], [-24, 22, -9, 36, -168]]

A:
[92, 0, 93, 72, 36]
****