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: [[-45, -1, -51], [-156, -12, -52, -85, -77, -21, -82], [-134, -82, -110, -168], [-118, -182, -74], [21, -44, 78]]

Output: [-1, -12, -82, -74, 78]


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: [[73, -120, -70, -14], [-107, -177, -110, 17, -187], [-196, -85, -145, -153], [30, 52, -128, -39, -65], [-118, -154], [44, -112, -75]]


Output: [73, 17, -85, 52, -118, 44]