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: [[-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: [[-112, -32, 5, -133], [-57, -42, -9, 22, 64]]

Output: [5, 64]


Input: Consider Input: [[-15, 93, -70, -39], [-157, -29, 74, -14, -155], [74, -176, -85, -143, 4, 0, -25]]


Output: [93, 74, 74]