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: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

Output: [98, 30, 96, 87, 96, 67, 53]


Input: Consider Input: [[-20, -106, -178, 55], [-140, -84, -171, -91]]

Output: [55, -84]


Input: Consider Input: [[-132, 82, -46, 16, 97], [-87, -121, -103], [93, -47, -32, -126], [-167, 18, -46], [79, -170, -121], [55, -172, -196, 20, 65, -177], [-117, 80]]


Output: [97, -87, 93, 18, 79, 65, 80]