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: [[-188, 39, -44, -107, -22, 98, -9], [84, 6, -2, -157]]

Output: [98, 84]


Input: Consider Input: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]

Output: [49, 34, 10, 52, 78, 31, 30, 18]


Input: Consider Input: [[-53, 22, -14, -141, 2], [92, -186, 24, -58, -165, 45, 55], [-87, -46, 3, 19, -135], [-109, 54, -102, -7], [-40, 68, 38, -55, 33, -193], [50, -53], [-95, -185, 33], [-103, -117, -75, -92, -158], [66, -19]]


Output: [22, 92, 19, 54, 68, 50, 33, -75, 66]