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: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

Output: [75, 34, 96, 33, 21, 50, 17]


Input: Consider Input: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]

Output: [-4, 92]


Input: Consider Input: [[-194, -45, -174], [-192, -107, -131, -142, 80], [62, 26, -119, -65, -6, -53, 65], [60, -117, 50, 7, 4, 35, 47], [38, -41, 24, -152, -164], [-83, -54, -134, -139, -174, -17]]


Output: [-45, 80, 65, 60, 38, -17]