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: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

Output: [91, 100, 86, 84, 13, 53, -32, 54]


Input: Consider Input: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]

Output: [93, 68, 96, 94, 81, 71]


Input: Consider Input: [[96, -100, -102, 19, -46, 60, -31], [-70, 93], [-194, 33, -133, 96, -169], [-14, -182, 51, -200, -179, 9], [12, -63, -92], [-112, -75, -52, 81, -50], [-44, 40, -67, -143, -84, -33, -122]]


Output: [96, 93, 96, 51, 12, 81, 40]