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: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

Output: [33, 66, 95]


Input: Consider Input: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

Output: [38, 98, 39, 24, -38, 1]


Input: Consider Input: [[75, -18, -107, -28], [-126, -4, -192, -170, -37, -76, -170], [66, -100, -147, -14, -172, -102, 74], [-61, -59, -116], [-32, -180, -34, 21, 28], [-46, -81, 60, 9, 69, 45]]


Output: [75, -4, 74, -59, 28, 69]