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: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

Output: [87, 7, 73, 69, 96, -106, 48, 84]


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: [[57, 53], [-104, -178, -4, -147, -89, 5], [-108, 2, 92, -104, -34], [-153, -119, -1, -155], [-78, -60, 65], [63, 31, 68, -26, -171, 75], [-166, -45, 13, -129]]


Output: [57, 5, 92, -1, 65, 75, 13]