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: [[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]

Output: [89, 45, 87, 77, 89, -4, -79, 41]


Input: Consider Input: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

Output: [48, -87, 96, 54, 91, 58, -23]


Input: Consider Input: [[26, 62, -94, -16, 39], [-17, -176, 15, -82, -161, -134], [-32, 76, 99, -198, -64], [-119, -168, 11, 43, 81, 27, -87], [-68, 23, 22, -103, -69, 79, -13], [-115, -32, -58, 5], [-86, 13, -160, 85, 4], [-198, -179, -78, -91, -162, 90]]


Output: [62, 15, 99, 81, 79, 5, 85, 90]