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: [[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: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]

Output: [27, -10, 40, 78, 74, 22, 51]


Input: Consider Input: [[64, -35, -37, -149, 75], [85, -81, -166], [-97, -143], [21, 76, -57, -83]]


Output: [75, 85, -97, 76]