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: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]

Output: [67, 26, 66, 99]


Input: Consider Input: [[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]

Output: [97, 45, 26, -42, 45, 44, 27, -42]


Input: Consider Input: [[-80, -73, 58, -24, -72, -110, -142], [-163, 65, -95, 80], [-109, 72, -120, -140, -110, 96, -196], [19, 61, -156]]


Output: [58, 80, 96, 61]