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: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]

Output: [76, 28, -16, 28, 74]


Input: Consider Input: [[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]

Output: [65, 45, 9]


Input: Consider Input: [[-183, -61, -125], [-94, -156, -6, -182, -155, -136]]


Output: [-61, -6]