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: [[44, 37, -10, 4, -109, 87], [-62, -48, 51, -171, -162], [-41, 10, -49, -32, -116], [89, 100, -192, -33, -41, -17, -19], [86, 16], [-92, -131, 2, -25, 10, -84, -124], [-119, 77], [58, 23], [-103, -64, -166, 74]]
Example Output: [87, 51, 10, 100, 86, 10, 77, 58, 74]

Example Input: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]
Example Output: [-68, 30, 99, 15]

Example Input: [[-90, 44, -125, -123, -178, -112], [-5, -16, 43], [-43, -4], [-96, -12, 26, -20, -70, -56], [-73, -80, 98, 66, -128, -194], [-58, 92, -20, -100], [-170, -199, 39, -156, -165, -149], [-35, 59]]
Example Output:
[44, 43, -4, 26, 98, 92, 39, 59]