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, -29, 4, 70, -1, 66], [-63, -199], [-128, 88], [-80, -95, -40, 51, -97], [-55, -200, -186], [-103, -104, -9, -179, 93, -82, -129]]

Output: [70, -63, 88, 51, -55, 93]


Input: Consider Input: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

Output: [98, -44, 98, 19, -1, 50, 98, -17, 48]


Input: Consider Input: [[-44, 12, -73], [-47, -119, 54], [37, -101, 79, -169, -84], [-14, -158, -21, -48, -56], [-121, -54, -5], [9, -151, -105], [-135, -106, -150, -123, -114, 83]]


Output: [12, 54, 79, -14, -5, 9, 83]