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.

[[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]
[99, -20, 93, 56, 24, 100]

[[-31, -48], [7, -142, -76]]
[-31, 7]

[[-137, -181, -14, 72, -96, 15], [91, -178, 49, -184, 13, -87], [-121, -144, -143, -144, 1, -129, -192], [-30, -4, 92, -21], [43, -79], [-10, -130, -122, -111, -46, -175, -129], [87, -11, -61, -6], [-53, -193, 94]]

[72, 91, 1, 92, 43, -10, 87, 94]