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: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]
Example Output: [93, -100, 50, 56, 90, -87, 74, 82, 49]

Example Input: [[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]
Example Output: [-19, -24, 93, -55, 52, 96, -22]

Example Input: [[-65, 8, -142], [44, -199, -17, -4, -109, -160, 100], [-60, -125, -177, -13, -89], [-150, -183, -175, -75]]
Example Output:
[8, 100, -13, -75]