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.

Example Input: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
Example Output: [17, 85, 20, 70, 12, 73, 90, 59, 58]

Example Input: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]
Example Output: [23, 99, 54, 29, 98, 95, 65, 88, 51]

Example Input: [[-120, -147], [-15, 61], [-197, -68, -86, 39, 13], [11, -49, -106, -178], [55, 56, -117, -33, 41, -191], [-34, -106, -107, 49, -56, 12, -90], [-35, -111, -145]]
Example Output:
[-120, 61, 39, 11, 56, 49, -35]