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: [[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]
Example Output: [-2, 31, 57, 0, 55, 94, 49, 57, 9]

Example Input: [[-72, 58], [-110, -110, 92, -58, -181, -159, 35], [-12, 67, -22, -15, -8, -190], [-163, -166, -128, -150, 70, 54]]
Example Output: [58, 92, 67, 70]

Example Input: [[-187, 91, 80, 90, -179, 50, 68], [75, -165, -161, -179, -192, 43, -177], [-161, 23, -152, -123, 38], [-127, 95, 99, -80, 24, 97], [21, -175, -25, 69, -24], [-56, -161, -36, 43, -104, -92], [-120, 8, -123, 96]]
Example Output:
[91, 75, 38, 99, 69, 43, 96]