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, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]

Output: [-68, 30, 99, 15]


Input: Consider Input: [[49, -82, -118, -198, 28, -171, -74], [-72, -35, -32, -120, -131, 24], [-92, -135], [-71, -91, 14, 80, -124, 75], [-160, -54, 19, -151, -90], [18, 48, -175, 93, 48], [100, 54, 64, -82, -190, -199], [-21, 42], [-112, 84, -196]]

Output: [49, 24, -92, 80, 19, 93, 100, 42, 84]


Input: Consider Input: [[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]


Output: [-68, 43, 91, 96, 85, 80]