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.

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

Output: [84, 66, 12, 62, 32]


Input: Consider Input: [[-45, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]

Output: [100, 86, 87]


Input: Consider Input: [[31, -130, -180, -98, 12, 82], [49, -11, -12, -197, -191, -183], [-115, -22, 30, -13], [-47, 83], [-49, -83, 41, 38, 36, -147, -126], [-134, -198, -18, -144, -176, -75], [94, -121], [-41, -124, -180, 29, -22]]


Output: [82, 49, 30, 83, 41, -18, 94, 29]