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: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

Output: [58, 19, 68]


Input: Consider Input: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]

Output: [38, 66]


Input: Consider Input: [[-99, -132, 11, -165, -121], [-87, -140, 80], [-167, -13, 71, 52], [10, -76, -35, -38, 97]]


Output: [11, 80, 71, 97]