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: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]

Output: [36, 69, 66, 79]


Input: Consider Input: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]

Output: [35, -69, -81, 92, 91, 58, 48, -41]


Input: Consider Input: [[-35, -168, -173], [-128, -149, -142, -43], [92, -84], [-177, -153, 87, -193, 68, -35, -184], [9, -132, 49, -78, -4, 66], [19, -158, -127, -110, -39], [13, 44, -22, 69], [-30, -187]]


Output: [-35, -43, 92, 87, 66, 19, 69, -30]