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: [[-27, -28, 59, -2, -90, 50, -81], [9, 83, -62, 32]]

Output: [59, 83]


Input: Consider Input: [[-8, -120, 75, -194, -81], [-173, 53], [1, -85, -102, -2, -9, 12, 67], [54, -88, -41], [26, -164, -178, -100, -68, -63], [-68, 15, 31, -176, -164, -132], [-140, -189, -35, -163, -77]]


Output: [75, 53, 67, 54, 26, 31, -35]