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: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
Example Output: [-105, 97, 59, 80, -47, -51, 9, 70, 81]

Example Input: [[-124, -118, 7, 22, -90], [58, 69, 0]]
Example Output:
[22, 69]