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: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
Example Output: [55, 64, 56, -31, -4, 51]

Example Input: [[-88, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]
Example Output: [52, -25, 74, 91, 52, 98, -13, 95]

Example Input: [[42, -150, -125, 3, -186, -104, -192], [0, -91, 56, -15, -72, 28], [-133, -14, -25, -49], [-132, -32], [-126, -64, 25, -25, -45, -83], [-159, -162, -89, -68, -62]]
Example Output:
[42, 56, -14, -32, 25, -62]