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: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

Output: [38, 98, 39, 24, -38, 1]


Input: Consider Input: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]

Output: [91, 82, 18, 46, 37, 17, 46, 74]


Input: Consider Input: [[3, -138, -8, -81], [59, 74, 7, -32], [45, -190], [-27, -59, -175, 54, 1], [-174, -52, 25, -85], [-45, -168, -143, 68, -24], [-152, -124], [-138, 100, -55], [-194, -5]]


Output: [3, 74, 45, 54, 25, 68, -124, 100, -5]