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: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]

Output: [99, 32]


Input: Consider Input: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]

Output: [12, -10, -48, -35]


Input: Consider Input: [[-150, 25, -200, 11, -41], [-73, 49, -85, -3], [-45, -17, -2, -1, 22], [96, -191, -55, -80, 28, -56], [-125, -200, -141], [-43, 74, 68, 41], [41, -91, -117, 94], [-121, 79, 70, 56, 64, -71, -24], [-128, -186, -101]]


Output: [25, 49, 22, 96, -125, 74, 94, 79, -101]