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: [[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]

Output: [66, 78, -6, 42, 66, 42]


Input: Consider Input: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

Output: [98, 30, 96, 87, 96, 67, 53]


Input: Consider Input: [[-53, -142, -24, -3, -41], [40, -1, -105, -42, -45, -36], [-64, -41], [-180, -172, -23, -120], [-65, -128, -186, 53]]


Output: [-3, 40, -41, -23, 53]