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, -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: [[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]

Output: [49, 68]


Input: Consider Input: [[11, -76, 0, -3, -131, 47, 16], [73, -132, -59, -17, 88], [70, -179], [25, -65, -145, -27, -159], [-98, 84]]


Output: [47, 88, 70, 25, 84]