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: [[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]

Output: [78, 2, 43, 74, 67, 31, 40, 91]


Input: Consider Input: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

Output: [53, 41, 80, 98, 91, 62]


Input: Consider Input: [[-156, -197, -41, 97], [-73, 18, -3, 64, 20, 10], [22, -15], [38, -89], [40, -5, -41], [-33, -135, -124, 6, 14, 34, -104]]


Output: [97, 64, 22, 38, 40, 34]