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: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]

Output: [53, 55, 93, 90, 75, 10]


Input: Consider Input: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

Output: [-93, 50, 32]


Input: Consider Input: [[-7, -38, -173, 89], [90, -49, -69, -83, -99], [-100, -35, -104, -122, -66, 7, 99], [-135, -55, -40, -37, 69, -119, -62], [71, 70, 53, 58, 11]]


Output: [89, 90, 99, 69, 71]