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: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

Output: [28, 70, 52, 63, -145, 11]


Input: Consider Input: [[6, -22, -195, 87], [-198, 60, 87, 19, 98, -147, 94], [-62, 50], [-159, -118, -193], [-165, -176, -157, -43, -121, -73], [32, 51, -24, -37, 80], [-110, -100, -198, -145]]

Output: [87, 98, 50, -118, -43, 80, -100]


Input: Consider Input: [[-34, -67, 37, 50, -92, -59, -58], [-129, 2, -171], [68, -135, -147, 52, -96, -42], [-2, 62, -134, -138, -177], [-144, 77, -180, -116], [41, 49, -163, 58, 72, -164]]


Output: [50, 2, 68, 62, 77, 72]