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: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]

Output: [79, -33, 2, 42, 81, -142, 71]


Input: Consider Input: [[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

Output: [38, 25, -7, 1, 40, 92, 87, 76, -95]


Input: Consider Input: [[1, -16, 41, -121, 9, -12, -65], [-199, 10, -142, 80, -182], [-94, 10, 9, -11, -158, -154, 9], [51, -153, 29, 38, -192, -24, -195], [-80, 37, -16, -192, 45, -62], [-172, -49, -96, -89, -162, -137], [-21, -156, -172], [-71, -72, -70, -139, -142], [39, -123, -125, -149]]


Output: [41, 80, 10, 51, 45, -49, -21, -70, 39]


