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: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]

Output: [71, -3, 48, 90, 92]


Input: Consider Input: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]

Output: [-7, 71, 29, 59, 93, 71]


Input: Consider Input: [[13, -25, -55, -182, -47, 58, 69], [-174, 89, -88], [60, 52, 43, 6]]


Output: [69, 89, 60]