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.

Example Input: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]
Example Output: [63, -33, 43, 68]

Example Input: [[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]
Example Output: [97, 25, 45, 51, -113, -56, 41, -40, 74]

Example Input: [[-146, 11, -6, 51, 91, -37, 52], [-144, 80, 99, -38], [-145, -132, 95, -31], [92, 84, -108, -180, -44, 78], [-51, -27, -152, -114, 75, -53], [-31, 19, -171, 19, 38], [-123, 56, -40, -22], [96, 8]]
Example Output:
[91, 99, 95, 92, 75, 38, 56, 96]