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: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]
Example Output: [84, 1, 35, -78, 24, 87]

Example Input: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]
Example Output: [-17, 5, 41, 4, -46, 80, 92, 65, 69]

Example Input: [[38, -109, -175, -102, -22, 70, 47], [-28, 25, -135, -191, -71, -15, 83], [59, 34, 31, 19, -107, -111], [-63, -57, 75, -190, -75], [-185, -105, -196], [64, -163, -173, -31, -2, -174, -186], [39, 93, -17, 22, -113, 34, -55]]
Example Output:
[70, 83, 59, 75, -105, 64, 93]