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: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]

Output: [25, 54, -45, 79, 96]


Input: Consider Input: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]

Output: [100, -120, -94, 63, 50, -139, 80, 56, 88]


Input: Consider Input: [[-109, 19, -57, -90, -35, -152, -39], [8, 91, -91, -116, -176], [-115, 42, 24, -171, -128, -175, -31], [27, -150, -86, 54, -156], [-182, -124], [-141, 82, 59, 64]]


Output: [19, 91, 42, 54, -124, 82]