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: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

Output: [100, 97, 77, 11, 52, 74, 99, -25, 8]


Input: Consider Input: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

Output: [90, -4, 18]


Input: Consider Input: [[-87, -132, -166, 93, 10, -177, 38], [-161, -197, 80, 90, -88, 87, 59]]


Output: [93, 90]