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: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]

Output: [43, -1, 40, 80, 73]


Input: Consider Input: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

Output: [-76, -61, 22, 62]


Input: Consider Input: [[-128, -168, 23, -146, -89, -114, 68], [91, 71, -84, -113, 39], [-12, -69, -98, -143, -120], [58, -147, -136, -173, -138], [-65, -98, -114, -100, -189], [-46, -28, -78, -199], [-12, 88], [-200, 99, 83, -15, -73, -63], [86, -11, 2, -142]]


Output: [68, 91, -12, 58, -65, -28, 88, 99, 86]