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: [[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]

Output: [97, 25, 45, 51, -113, -56, 41, -40, 74]


Input: Consider Input: [[-8, -195, -141, -165, -183, -5], [88, -22, -176], [93, 47, 11], [-2, -178, -76, -118, -193, -39], [-98, 22, -150, 67, -158, -133, -61], [72, -124, 63, -187, -45], [-193, -85, -48, -49, -17], [-119, 27, -119, -146, -50]]

Output: [-5, 88, 93, -2, 67, 72, -17, 27]


Input: Consider Input: [[-21, -175], [82, 88, -6, -25, -161, -102, -51], [8, -44], [88, -70, -124, -142], [-191, -184, -50, -87, -13], [91, -78], [-197, -56]]


Output: [-21, 88, 8, 88, -13, 91, -56]