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: [[-29, -139], [-113, 72, 88, -95, -146, -186], [31, -151, -171, -180, -87, -12, -181]]

Output: [-29, 88, 31]


Input: Consider Input: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

Output: [60, -36, 94, 68, 36, -64, 41]


Input: Consider Input: [[-52, -183, 64], [-176, 64, -31, -144], [18, 95, 18], [-198, -14, -29, 93, 70], [-159, 60, 81, 39, -104], [-197, -133], [-21, 42]]


Output: [64, 64, 95, 93, 81, -133, 42]