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: [[-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: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]

Output: [9, -5, 62, -35, 92, -30, 91]


Input: Consider Input: [[-114, 78, -165], [99, 36, 53, -49, -56], [10, -152, 39, -113, 45, -85], [-154, -196, 26], [-35, -176], [-153, -130]]


Output: [78, 99, 45, 26, -35, -130]


