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]: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]
[A]: [-110, 37, 0, 24]


[Q]: [[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]
[A]: [92, 29, -2]


[Q]: [[25, -189, -85, -47, -70], [-57, -125, 76, -134, 82, 40], [94, 20], [-37, 72, 77, 70, -16], [-31, -162], [-156, -105, 54, 64, 15, -159]]
[A]:
[25, 82, 94, 77, -31, 64]