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: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

Output: [78, -56, -80, 89, -112, 49, -93, 91, -94]


Input: Consider Input: [[-38, 56, -23], [-19, -178, -59]]

Output: [56, -19]


Input: Consider Input: [[-77, 21, 0, 53, -88, -32], [-132, 89, 87, 33, -154, -95], [84, -151, 59], [85, -88, 56], [-189, 1, -16, -1, 71, -185, -20]]


Output: [53, 89, 84, 85, 71]