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: [[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]

Output: [34, 17, 30, -1, 5, 37, 24, 81]


Input: Consider Input: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]

Output: [-4, 92]


Input: Consider Input: [[-3, -101], [-131, 76]]


Output: [-3, 76]