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: [[-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: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

Output: [65, -105, 61, 82, 98]


Input: Consider Input: [[66, -91, -178, 47, -92], [-157, -137, -92, -20, -169, -164], [-144, 60, 83, 75, -42, -10, -84], [100, -12, -20, -155, -6], [-86, -85, -98, -120, 26, -67, -155]]


Output: [66, -20, 83, 100, 26]