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: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

Output: [-42, 88, 91, -13, 34]


Input: Consider Input: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

Output: [58, 19, 68]


Input: Consider Input: [[-72, -44, 87, -90, -22, 80], [-35, -13], [-31, 67, -121, -81, 46, -68, 62], [-31, 46, -63, -99], [-170, -37, 76, 64, -19, 62], [27, -180, -60, -63, 36, 71, -62], [65, -106, 88, -35, -16, -37, -128], [-62, -150, -71, 89, -96], [-28, -18, -114]]


Output: [87, -13, 67, 46, 76, 71, 88, 89, -18]