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: [[-48, -41, 45, -29, -161], [-163, -76]]

Output: [45, -76]


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: [[-93, 62, -178, -23, -15], [-35, 41, -67, 34], [-71, -81, 85, -172, -53, -39], [-158, -15, -156, -71, 47]]


Output: [62, 41, 85, 47]