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: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

Output: [75, 51, 10, 53, -43, 17, -111]


Input: Consider Input: [[-129, 49, 63], [57, -92, 0, -186, -74], [-38, -133, -92, -124, 73, -70, 75], [-113, 70, -87, -101, -154, -163, -30], [18, -52], [-170, -50, -196, -35, -135, -18]]


Output: [63, 57, 75, 70, 18, -18]