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: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]
Example Output: [27, -10, 40, 78, 74, 22, 51]

Example Input: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]
Example Output: [55, 92, 45, 57, 41, 86, 35, 85, 85]

Example Input: [[-95, -174, 90, -191, -33], [-76, -197, 89, 95, -153, -100], [-56, 26, -168, 71], [31, -175, -121], [30, -135, -112], [-5, -135, -81, -182, -169, 57], [-51, -20, -144, -179, 15, -117, 82], [-43, 21], [61, -108, -66, -3, -50]]
Example Output:
[90, 95, 71, 31, 30, 57, 82, 21, 61]