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: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

Output: [77, 81, 85, 93, 54, 88]


Input: Consider Input: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]

Output: [98, 56, 93, 13, 28, 59, 74]


Input: Consider Input: [[-74, -168, -114, -43, 2], [3, -157, 91], [-37, -175, -77, 73, -90, -155, -163]]


Output: [2, 91, 73]