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: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]

Output: [49, -27, -132, 98, 73, 74]


Input: Consider Input: [[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]

Output: [92, 29, -2]


Input: Consider Input: [[-134, -11], [-140, -41, -75, -27, -98, -65], [14, -181, -13, 93, -194], [48, -165], [-51, 4], [-105, 40, -88, -109, 40, -100, -106], [96, -22, -31, 7, -81, 75], [30, -153, 27, 29, 38, -180]]


Output: [-11, -27, 93, 48, 4, 40, 96, 38]