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: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

Output: [-18, 95, 50, 81, 49, 91, 94, 59]


Input: Consider Input: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]

Output: [23, 99, 54, 29, 98, 95, 65, 88, 51]


Input: Consider Input: [[-18, -66, -42, 66], [-195, -133, -72, 45, -42, 82], [-116, -200, -70, -186, -177, -48, 84], [-85, -149, -185], [13, -119, -57, 97, -142, -136, 1]]


Output: [66, 82, 84, -85, 97]