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: [[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]

Output: [78, 86, -72, -153]


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: [[-199, -106, -120, -47], [-50, -108, -171, 22, -175, -27], [-75, -35], [69, -35, -34, -65, -78, -96], [38, -195, -171, 69], [-92, -141, 2, -98], [69, -186], [-107, 59, -200], [-51, -76, 82, -169, 86]]


Output: [-47, 22, -35, 69, 69, 2, 69, 59, 86]