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: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

Output: [33, 66, 95]


Input: Consider Input: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]

Output: [78, 53, 93, 86, -31]


Input: Consider Input: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]


Output: [52, 80, 98, 38, 69, 81, 8, 64]