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, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]

Output: [-20, -7, 84, 98]


Input: Consider Input: [[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]

Output: [9, 83, 81, 93, 48, 2, -73, 50]


Input: Consider Input: [[91, 11, 5, -95, -4], [25, -16, -52], [57, -55, -188, -156, -152, -189, -96], [34, 38], [-56, 38], [44, -23, 34, 66, 49, -1], [10, -119, -102, -85, -75], [-195, -148, 65], [-164, 84, -9, -106]]


Output: [91, 25, 57, 38, 38, 66, 10, 65, 84]