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: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

Output: [48, -87, 96, 54, 91, 58, -23]


Input: Consider Input: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]

Output: [-92, 90, 8, 74, -126, 6, 7, -86]


Input: Consider Input: [[63, -60, -4, 49], [-70, -197, -152], [84, -93, -150, -109, 42, 44, -134], [88, 50, -116], [-103, 98, 61, -85, -119, 81, 2], [-133, -162, -113, -141, 94, -114, 45]]


Output: [63, -70, 84, 88, 98, 94]