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: [[78, 3, -186, -60, -85, -7], [-3, -75, -30], [63, -19, -166], [-47, -88, 58], [-94, -36, -79], [-134, -2, 43, 87]]

Output: [78, -3, 63, 58, -36, 87]


Input: Consider Input: [[-58, -38, -120], [-198, -11, -4, -141], [-129, -72, -6, 96, -181, -165], [70, 98, -197, 14, -191, -95, -173], [-81, -153], [-88, 70, 1, -4], [-17, -46, 5, 60, -161, -124], [-85, -29, -59, 15, -128, -116], [-199, -76, 79, -28]]


Output: [-38, -4, 96, 98, -81, 70, 60, 15, 79]