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: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

Output: [48, -87, 96, 54, 91, 58, -23]


Input: Consider Input: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]

Output: [76, 28, -16, 28, 74]


Input: Consider Input: [[-196, 44, 98, -103], [44, 98], [-175, -161, -145, 87], [65, -78, 79], [73, 49, 72], [-73, -87, -138, -182], [60, 38, 77]]


Output: [98, 98, 87, 79, 73, -73, 77]