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: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]

Output: [-37, 94, -21, 76, 85, 93, 72, 5, 87]


Input: Consider Input: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

Output: [33, 66, 95]


Input: Consider Input: [[98, -133], [-79, -148], [87, 79, -132, 52, -97, -129], [64, 34, 90, -22, 78, -119, -65], [5, -189, -192, 47], [11, -70], [77, -3, -173, -101, -110, -5, 57], [-194, 9, 2, -1, -2]]


Output: [98, -79, 87, 90, 47, 11, 77, 9]