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: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]

Output: [80, 83, 88, -39, 77, 60, -16, 93, 86]


Input: Consider Input: [[78, -179], [-154, 26, -194, -39], [73, -154, 7, -158, 45]]

Output: [78, 26, 73]


Input: Consider Input: [[-86, 18, -147, -45, 79, -155], [-90, -124, -122, 65], [66, 1, 45, -115], [-149, -45, -45]]


Output: [79, 65, 66, -45]