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: [[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: [[5, 20], [36, -36, -177, -145], [90, -26, -6, 12, 94]]

Output: [20, 36, 94]


Input: Consider Input: [[24, -124, -150, -116], [-137, 47], [-107, 90, -9, -93], [66, -22, -159], [-96, -92, -182, -90, -116, -73], [-11, 56, -52, -156, -164, -7], [-139, -116, -168], [2, -151, -8, -29, 46, -35]]


Output: [24, 47, 90, 66, -73, 56, -116, 46]