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: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

Output: [95, 60, 31, -122, 66, 84, 17]


Input: Consider Input: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]


Output: [64, 19, 84, 40, 78]