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: [[7, 42, -200, -138], [-113, -158, -17, -60, -38]]

Output: [42, -17]


Input: Consider Input: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]

Output: [-26, 31, -27, 94, 69, 47, 55, -8]


Input: Consider Input: [[-155, -94, 89, -84, -2], [93, -40, -41], [-21, -123], [-67, -85, -67, -21, -123, -88], [35, 34, 33, -54, -166], [-131, 62, -94, -131, 63, -26, -66], [37, 25, -162], [93, 89, -112, -46, -129, -25]]


Output: [89, 93, -21, -21, 35, 63, 37, 93]