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: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]

Output: [-105, 97, 59, 80, -47, -51, 9, 70, 81]


Input: Consider Input: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]

Output: [95, 58, 72, 99, 80, 89, -18, -25]


Input: Consider Input: [[-35, -149, -171, -13], [-125, -189, -3, 36, -39, -192, -87], [-104, -20, -27, 89, -127, 23, -31], [86, -26], [15, -194, -198, -106, -168, 39], [-49, -9], [46, 48, -50, -33, -172]]


Output: [-13, 36, 89, 86, 39, -9, 48]