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: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]

Output: [52, 8, 23, 54, -147, 61, 25, -44, 92]


Input: Consider Input: [[95, -100, -10], [-52, -130, -16, -86, -37, -181], [-126, -10, 3, -135, -67, 64, -5], [-101, -96, -155, -12, -63], [-130, -187, 20, 45], [-176, 87, -135, -75, -90, -189, -200], [-53, 74, -52, 29, -150], [-192, 48, -15, -148, -175], [75, -148]]

Output: [95, -16, 64, -12, 45, 87, 74, 48, 75]


Input: Consider Input: [[-15, -31, 46, -64, -8], [-62, -47, 49, 96], [-107, 93], [-15, 31, -118, 70], [-92, -179], [-147, 2, 18, -168, -123, -130, -15]]


Output: [46, 96, 93, 70, -92, 18]