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: [[-15, 93, -70, -39], [-157, -29, 74, -14, -155], [74, -176, -85, -143, 4, 0, -25]]

Output: [93, 74, 74]


Input: Consider Input: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

Output: [51, 69, 92, 52, 82, 70, 65]


Input: Consider Input: [[74, -78, -61, -56, -24], [-35, -65, -69], [-184, -117, -197, 56, -36, -97], [-108, -56, -104, -173, 19, 59, 14], [-73, -196, -1]]


Output: [74, -35, 56, 59, -1]