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: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

Output: [65, -105, 61, 82, 98]


Input: Consider Input: [[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]

Output: [97, 45, 26, -42, 45, 44, 27, -42]


Input: Consider Input: [[-35, -88, 71], [-100, 4, 80, 27], [-55, -151, 4, 37, -80], [21, 53, -157, -125], [12, -190, -22, -194, 25], [90, -164, -178, 58, 72, 30, -39], [-171, -44, -2, -177], [99, -5, -84, -156, -199, -94, -82]]


Output: [71, 80, 37, 53, 25, 90, -2, 99]