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: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

Output: [77, 81, 85, 93, 54, 88]


Input: Consider Input: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]

Output: [43, -1, 40, 80, 73]


Input: Consider Input: [[-105, -56, 46], [53, -142, -138, -147, -179, -27], [-172, 59, -23, 52, -139, 96, -159], [-58, -153, 82, -21], [-7, -60, 16, -137, 35, 39, 61]]


Output: [46, 53, 96, 82, 61]