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: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]

Output: [97, 90, 93, 52, 52, -29, 37, 79, 80]


Input: Consider Input: [[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

Output: [-163, 37, 98, 77, 58, 47]


Input: Consider Input: [[-172, -64, 48, 24], [-105, 71, -6, -42], [29, 25, -115], [78, -118, 44], [-62, -35, -71, -41, -98, -181], [-197, -193, -139, -133]]


Output: [48, 71, 29, 78, -35, -133]