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: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]
Example Output: [93, 68, 96, 94, 81, 71]

Example Input: [[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]
Example Output: [43, 72, 10, 92, 85, -104, 41, 19]

Example Input: [[-79, 79, -165, -42, 12], [-155, -71, -124, -46, -9, -141], [57, 52, 65, -159, -103, -103, -166], [-200, 2, -70, -155, -183], [-95, 94, -191]]
Example Output:
[79, -9, 65, 2, 94]