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: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]

Output: [75, 95, 70, 68, 100, -2, 15, 32, 97]


Input: Consider Input: [[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]

Output: [44, -43, 93, 23, 9]


Input: Consider Input: [[-178, -24, -99, -81, 71], [-131, -183], [-37, -150, -140, -23, -184, -51], [-129, -54, -61, 0, 40, -94, 12], [17, -70, -72, -74], [-179, -192, 65, -65, -95, 82, -131], [15, -125, 49], [-106, -35, -178, 25], [58, -85]]


Output: [71, -131, -23, 40, 17, 82, 49, 25, 58]