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: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Output: [38, 80, 94, 31]


Input: Consider Input: [[-194, 62, -175, 20, -32], [-156, -140, -25, -157, -65, 20, -108], [-65, -2, -29, 73, -16, -113], [34, 91, 76, -116], [26, -176, -46, 23, 88, -14, 31], [-139, -89, 83, -83, -12, -88, -156], [-59, 4], [9, -142, 27, -39, 23, -60, -127]]


Output: [62, 20, 73, 91, 88, 83, 4, 27]