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]: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]
[A]: [47, 40]


[Q]: [[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]
[A]: [96, 94]


[Q]: [[-128, -94, -168, 20, 60, -86, -82], [64, -5, -85], [-184, -50, 91, -161, 18], [19, -15, 51, 15, -159, -103, -181], [-141, 15, 16, -95, -67], [-73, -169], [56, -189, -9, 57, 30, -2, -21]]
[A]:
[60, 64, 91, 51, 16, -73, 57]