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: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

Output: [18, 84, -83, 96, -52, 90, 76]


Input: Consider Input: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]

Output: [-10, 25, 77, 94, 79, 40]


Input: Consider Input: [[4, -178, 85, -111, -113, -67], [-141, -113, -80, -35], [-40, 25, 67, -30, -159, -84], [-173, -133, -168]]


Output: [85, -35, 67, -133]