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: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

Output: [93, -100, 50, 56, 90, -87, 74, 82, 49]


Input: Consider Input: [[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]

Output: [78, 2, 43, 74, 67, 31, 40, 91]


Input: Consider Input: [[-106, -66, -118, -129, -5], [47, -129, -193, -13, -52, 53, -35], [-196, -187], [-171, -110, -27, -176, -37, -41], [-124, -47, -100], [-38, 47, 66, -66, -64, 67, 87], [-55, -93], [2, -100, -95, -117], [91, -123, -113, -135]]


Output: [-5, 53, -187, -27, -47, 87, -55, 2, 91]