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: [[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]
Example Output: [-2, 31, 57, 0, 55, 94, 49, 57, 9]

Example Input: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]
Example Output: [78, 70, 89, 9]

Example Input: [[-66, -45, -114, -168, -36, -68], [61, 14, -174, -153, 100, -126], [57, -1, -16], [-16, 64], [26, 12, 10, 54, -96], [83, 91, 9, -178, 72]]
Example Output:
[-36, 100, 57, 64, 54, 91]