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: [[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]

Output: [-42, 30, 87, 34]


Input: Consider Input: [[-88, -78, -21], [-154, -184, -116, -32, -111, -121], [-14, -137, -43, -117], [-75, 38, -76, -138, -108, -102, 42], [12, -66, -91, 100, -55, 2]]

Output: [-21, -32, -14, 42, 100]


Input: Consider Input: [[-113, -134, -79, -180, 37], [-71, -135], [-15, -28, -101, -71], [-97, -200, -179, 91, -154, 40], [10, -180, -196, -191, 31, 89, -123], [-182, 30, -97, -39, -41, -44, 82], [75, 60, -84, 93, -147, -42, -89], [77, 69, 43], [82, 61]]


Output: [37, -71, -15, 91, 89, 82, 93, 77, 82]