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: [[-154, -145, 28, -154, -52, -41], [-198, 0]]

Output: [28, 0]


Input: Consider Input: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Output: [29, 63, 12, 34]


Input: Consider Input: [[1, -16, 41, -121, 9, -12, -65], [-199, 10, -142, 80, -182], [-94, 10, 9, -11, -158, -154, 9], [51, -153, 29, 38, -192, -24, -195], [-80, 37, -16, -192, 45, -62], [-172, -49, -96, -89, -162, -137], [-21, -156, -172], [-71, -72, -70, -139, -142], [39, -123, -125, -149]]


Output: [41, 80, 10, 51, 45, -49, -21, -70, 39]