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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

Output: [60, 26, 61, 74, -28]


Input: Consider Input: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]

Output: [96, 2, 19, 59, 43, 38, -46]


Input: Consider Input: [[62, -169, 55, 89, 87], [-27, -33, -41, 3], [84, 43, -122, -112, 16, -50], [38, -111, -200, -103, -168, -186], [2, -85], [90, -67, 31, -188, -172, 100], [17, -89, -196, 34], [26, -190, -71], [-123, -63, -161, -167, 0, -146]]


Output: [89, 3, 84, 38, 2, 100, 34, 26, 0]