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: [[-59, 44, -29], [-168, -64, -74, 51, -166], [-22, -130, -9, -67, -98, 46, -114]]

Output: [44, 51, 46]


Input: Consider Input: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

Output: [92, 46, 25, 19]


Input: Consider Input: [[-9, 83, -23, -170], [-78, -153, 7, -17, -183, -138], [-2, -187, -20], [5, -14, -42, 2, -100, -175, -142], [-54, 15, -94, -150], [-106, -162, -65], [47, 76, -86]]


Output: [83, 7, -2, 5, 15, -65, 76]