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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]
Example Output: [83, 79, 34, 49, 11, 75, -6, 67, -96]

Example Input: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]
Example Output: [-4, 92]

Example Input: [[-84, 5], [-115, -110, -132, -142, -67, 98], [5, 51, -69], [-133, -196, -33, -80], [-40, -131, 9, -173, -1, -165, -155], [-100, -113, -99, -7, -87, -178, -65]]
Example Output:
[5, 98, 51, -33, 9, -7]