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: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]

Output: [-19, 15, 24, 84, -138, 76]


Input: Consider Input: [[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]

Output: [-4, 37, 90, 60, 55, 53, 83]


Input: Consider Input: [[68, -84, -70], [-162, 50, 49, -72, 83, -170, -9], [75, -110], [-197, -188, 98, -68], [-192, -128, 99, 73, -69, -8, -35], [-114, -28, -149, 19, -133, 78], [-34, -139], [93, -6, 61, -12]]


Output: [68, 83, 75, 98, 99, 78, -34, 93]