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]: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[A]: [71, 71, -38, 60, 7, 97, 76]


[Q]: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]
[A]: [97, 23]


[Q]: [[-14, -139, 11, -10], [-28, -157, 16], [-2, -22, 95, -28, -40, 76]]
[A]:
[11, 16, 95]