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: [[-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: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]
Example Output: [39, 6, 91, -7, 52, 99]

Example Input: [[-114, 78, -165], [99, 36, 53, -49, -56], [10, -152, 39, -113, 45, -85], [-154, -196, 26], [-35, -176], [-153, -130]]
Example Output:
[78, 99, 45, 26, -35, -130]