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: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]

Output: [19, -96, 60, 50, 63, 58, 92, 67]


Input: Consider Input: [[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]

Output: [83, 96, -38, 74, 50, -73, 51, 85, -26]


Input: Consider Input: [[-95, -147, -2, -98, 96], [99, -152, -12, 16], [-127, 8, 80, -59, -46], [-12, 21]]


Output: [96, 99, 80, 21]