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: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

Output: [22, -12, 60, 59, -8, 90]


Input: Consider Input: [[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]

Output: [4, 95, 28, 51, -75, 76, 64, 9]


Input: Consider Input: [[-82, -2, -87, -140, -45, 12, 61], [27, -56], [-107, 93, 30, -133, -64, -156], [-29, -16, -97, 17, 82, -56, -177]]


Output: [61, 27, 93, 82]