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: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

Output: [51, 49, 86, 66, 74, -151, 49, 25]


Input: Consider Input: [[-53, -26, -156, 87], [-73, -173, 18, -40, -175, 99], [-171, -75, 15, 18, -90, -162, -104]]

Output: [87, 99, 18]


Input: Consider Input: [[15, -115, 32, 79, -47, -177], [-128, -138, 55, -116, -199], [-133, 21, -32, -6], [-136, 74, -97, -60, -138, -124, -31]]


Output: [79, 55, 21, 74]