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: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]
Example Output: [67, 90]

Example Input: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]
Example Output: [98, 79, 97, 65, 71, 43, -72]

Example Input: [[96, -3, -77, -95, 59, -151], [90, 91, 19, 10], [-99, 80, -140], [55, -171], [-136, -33, -42, -90, 46, -35, 93], [-86, 48, -179, 81, 33, 2], [-44, -39, -186, -102, 70, 87, -31], [-102, -145, -170, 65, -57, -58], [-152, 75, -85, -113]]
Example Output:
[96, 91, 80, 55, 93, 81, 87, 65, 75]