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: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

Output: [78, -56, -80, 89, -112, 49, -93, 91, -94]


Input: Consider Input: [[-18, -120, -153, -70, 77, -106, -3], [-196, -40, -105, 2, -151, -114, 4]]

Output: [77, 4]


Input: Consider Input: [[-102, -75, -37, -125, 8], [92, -189, -183], [-62, -73], [-116, -146, -110, -64, 38, 37], [-76, 86, -169, -150, 80, 75, -184]]


Output: [8, 92, -62, 38, 86]