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: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
Example Output: [60, -32, 68, 93, 24, 26, 7, 85]

Example Input: [[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]
Example Output: [84, 66, 12, 62, 32]

Example Input: [[-196, -133, -73, -187, 54, -171], [-37, 38, 15, -189, -142, -165], [-174, -139, -31, -198], [-38, 57, -115, -21], [35, 12]]
Example Output:
[54, 38, -31, 57, 35]