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: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

Output: [98, 30, 96, 87, 96, 67, 53]


Input: Consider Input: [[20, -141], [-153, 62, 13, -129], [-197, 78, 14, -101], [40, -136, -81, -138], [-182, 84], [47, -184, -16], [5, -28, -3, -174, -139], [91, -121, -61, 55, 42]]

Output: [20, 62, 78, 40, 84, 47, 5, 91]


Input: Consider Input: [[-42, -192], [-98, -183, -177, -78, 33, -69], [19, -37, -166, -77, -119], [-137, -148, 91], [-149, 65], [76, -199], [73, 89, 22, -17, -68, -47]]


Output: [-42, 33, 19, 91, 65, 76, 89]