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: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]

Output: [99, 48, 31, 77]


Input: Consider Input: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

Output: [22, -12, 60, 59, -8, 90]


Input: Consider Input: [[48, -123, -80, -20, -11], [-194, -78, -188, -33, 58], [-161, -87, -40, -5, -126], [-113, -92, -7, 33], [-170, -15], [-100, 70, 70, -135, -40]]


Output: [48, 58, -5, 33, -15, 70]