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: [[97, -135, -83, -157, 30], [-24, 59, 42, -84, 64, -74], [6, 50, -174], [-170, 93, -66, -136]]

Output: [97, 64, 50, 93]


Input: Consider Input: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]

Output: [37, 75]


Input: Consider Input: [[-74, 49], [-80, -46, -42, -8, 65, -160, -80], [-158, 86, -10, 93, -92], [-12, 81, -32, 26], [-148, -190, -41], [77, 83, -72, -47], [-65, -125, 41], [-70, -21], [-108, -181, -93, 58, 37, -39]]


Output: [49, 65, 93, 81, -41, 83, 41, -21, 58]