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: [[-35, -72, -53, -9, 95, 58, -108], [-185, 72, -32, -90], [-117, -124, -172, 52, -37, -183], [-160, -193, -149, 25, -2], [-132, -182, -85], [-69, 39, -167, 57, -132, 13, 43]]

Output: [95, 72, 52, 25, -85, 57]


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: [[-17, -156, -59], [-86, -58, 54, 2, 57, -38]]


Output: [-17, 57]