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: [[-65, -132, -105, 40, 32, 84], [-53, -33]]

Output: [84, -33]


Input: Consider Input: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

Output: [75, 57, 75, 20, -95, 20]


Input: Consider Input: [[11, -154], [-34, -18, -27, 27], [-173, -140], [71, -59, -44, -158, 44], [-8, -18, -165, -6, -63, -97], [59, -170, -49, 23, -158]]


Output: [11, 27, -140, 71, -6, 59]