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: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

Output: [45, 17, 92, 12, 28, 8, -93]


Input: Consider Input: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

Output: [-63, 82, 79]


Input: Consider Input: [[99, -189], [37, 50, -151, -7, -42, -92, -186], [-129, 96, -53, -33], [14, 19, 81, 49, 76], [-168, 15, -107, 19, 85, -130, -84], [-67, -190, -62, 78], [-98, 72, -62, -45]]


Output: [99, 50, 96, 81, 85, 78, 72]