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: [[-54, -127, -178, -98], [7, 82, 69], [-159, -142, -82, -156, -100, 7], [-76, 88, -45, 41], [86, -169]]

Output: [-54, 82, 7, 88, 86]


Input: Consider Input: [[-135, 6, 32, -94, -171, -23, 45], [-97, -76, -119], [-181, -28, -160, 95, -37, 18], [-38, 88, 34, -117, -159, 61], [-122, -146, 44], [-10, -132, -23], [-144, -175], [-28, -196, -113, 38, 95, -6], [-159, 93, 0, 98, 73, -88, -24]]


Output: [45, -76, 95, 88, 44, -10, -144, 95, 98]