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: [[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]
Example Output: [9, 83, 81, 93, 48, 2, -73, 50]

Example Input: [[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]
Example Output: [69, 90, 14]

Example Input: [[7, -62, 39], [-69, -80, -38, -5, -48, -108, -55], [38, -173, 73, 50, -173, -106, -148], [-182, -14, -117, -25], [-120, -74, 32], [83, -20, -137, 28, 84, 95], [-105, -103, -143, -40], [-191, 40, -61, -84, 76, 33], [99, -6, 38, 40, -130, -58, 98]]
Example Output:
[39, -5, 73, -14, 32, 95, -40, 76, 99]