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: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

Output: [1, 62, 100, 26, 85, 56, -9]


Input: Consider Input: [[-59, 44, -29], [-168, -64, -74, 51, -166], [-22, -130, -9, -67, -98, 46, -114]]

Output: [44, 51, 46]


Input: Consider Input: [[23, 46], [-183, -48, -15, 33, -8], [-155, 78], [-162, -91, 42, -75, -96], [47, -32, 94, 94, -11, 98], [-155, -119, 35, 62, 68], [10, 60, -160]]


Output: [46, 33, 78, 42, 98, 68, 60]