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: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

Output: [57, 80, -20, -50, 8, 64]


Input: Consider Input: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]

Output: [80, 56, 46, 29, 14]


Input: Consider Input: [[-47, 70, 20, -85, -27, 43, -199], [-197, 18, -63, -36], [-46, -98, -200, 83], [93, 99], [55, -166, -17, -88, -95, -135, -163], [-192, -151, 63, -77, -54], [-119, -18, -25]]


Output: [70, 18, 83, 99, 55, 63, -18]