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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

Output: [-3, 50, -38, 51, 42, 54, 81, 76]


Input: Consider Input: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

Output: [98, -44, 98, 19, -1, 50, 98, -17, 48]


Input: Consider Input: [[-125, -41, -191, -197, 4, -127], [68, 35, 76, -4, -160, -81, -40], [-95, -169, -191], [-160, -60, -27, -81, -76, -8, -198], [-79, 54, -48, 33], [79, -94, -189, 42, -57], [94, -43, 42, -140, 98], [65, 60, -192, -192, -120, -170], [64, -184, 71, -83, -162]]


Output: [4, 76, -95, -8, 54, 79, 98, 65, 71]