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: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]

Output: [49, 34, 10, 52, 78, 31, 30, 18]


Input: Consider Input: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

Output: [61, 73, 78, 71, -99, 88, -30]


Input: Consider Input: [[79, 72, -69, -18, -199], [-92, -67], [-175, -170, 83, -90, -124, -131], [45, 24], [-120, 90, -21, -149, -127, 12], [86, -9, -99, -179, -112, 43, -119], [25, -25, 42], [73, 85, -87, -197, -37], [-38, 73]]


Output: [79, -67, 83, 45, 90, 86, 42, 85, 73]