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: [[-4, -186, 89, 50, 100, 24], [-135, -17, -4, 79, -42, -145], [-196, -130], [82, 74], [-187, 7, -164, -163, -109], [90, 76, -16, 13, 6, 89], [-89, 46]]
Example Output: [100, 79, -130, 82, 7, 90, 46]

Example Input: [[15, -109, -144], [-76, 24, -172]]
Example Output: [15, 24]

Example Input: [[45, 73, -80, -38], [-150, -41, -120, 51, 48, -184], [-61, -6, 51, -30, 69, 15], [73, -142, -25, 20, -115], [-77, -140], [-151, 48, -171, -61, -136, 59, 31], [-197, -15, -26, -18, -122, -140], [42, 77, -71, -180, 99, -121, -39]]
Example Output:
[73, 51, 69, 73, -77, 59, -15, 99]