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: [[49, -82, -118, -198, 28, -171, -74], [-72, -35, -32, -120, -131, 24], [-92, -135], [-71, -91, 14, 80, -124, 75], [-160, -54, 19, -151, -90], [18, 48, -175, 93, 48], [100, 54, 64, -82, -190, -199], [-21, 42], [-112, 84, -196]]
Example Output: [49, 24, -92, 80, 19, 93, 100, 42, 84]

Example Input: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
Example Output: [-33, 49, 37, -34, 92, 57, 19, 72, -92]

Example Input: [[-81, -85, -109, -139, -112, 75, -101], [-161, -104, -130, -188], [-137, -58], [29, 80, -12, 21, -144, 55, -13]]
Example Output:
[75, -104, -58, 80]