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: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]

Output: [100, 3, 97]


Input: Consider Input: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]

Output: [-17, 5, 41, 4, -46, 80, 92, 65, 69]


Input: Consider Input: [[-98, 32, 30, -142, -177, -185], [-71, -114, -181, -66, -157, -131, 77], [54, -126, -117, 16, -100, -174, -15], [-50, 93, 96, -77, 13]]


Output: [32, 77, 54, 96]