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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

Output: [83, 79, 34, 49, 11, 75, -6, 67, -96]


Input: Consider Input: [[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]

Output: [65, 75, 21, 82, 4, -3, 21]


Input: Consider Input: [[-20, -56, 56], [17, -59, -67, -63, -151, -17, -69], [-124, -19, -63, -44], [100, -30, -139, -51], [-75, -129, -137, -184, -97, 76, 80], [21, 39, -59], [78, 38, -32, 24, -84, 54, 56]]


Output: [56, 17, -19, 100, 80, 39, 78]