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: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]

Output: [53, 34, 91, 40]


Input: Consider Input: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]

Output: [94, 24, 12]


Input: Consider Input: [[81, -97, -179], [-49, -135]]


Output: [81, -49]