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: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]

Output: [-2, 57, 97, 30, 24]


Input: Consider Input: [[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]

Output: [81, 67, 86, 59, 75]


Input: Consider Input: [[-128, -171, -158, -180], [-46, -53, -146, -180, -108, 23], [78, -24, 65], [-125, -66, -75, -68], [-20, -67, -175, -161], [-144, 96, -107, -118, 91]]


Output: [-128, 23, 78, -66, -20, 96]