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: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

Output: [-23, 94, 42, 34, 96, 77, 73, 60, -25]


Input: Consider Input: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

Output: [31, -1, 65, -15, -38, 59, -23]


Input: Consider Input: [[43, -73, 89, 96, -199, -94, 75], [-185, -40, -37, 11, -9, -52, -116]]


Output: [96, 11]