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.

Input: Consider 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]]

Output: [-2, 31, 57, 0, 55, 94, 49, 57, 9]


Input: Consider Input: [[4, -119, -5, 16, -97], [-189, 64, 89, 8]]

Output: [16, 89]


Input: Consider Input: [[-74, 22, -43, -64, 16, 61, -21], [-118, -9, 19, -139, -29, 93, 79], [-66, 56, 70, -196, -62], [-35, -174, 90, -131]]


Output: [61, 93, 70, 90]