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: [[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]

Output: [-84, 64, 62, -1, 88, -71]


Input: Consider Input: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

Output: [40, 84, 55]


Input: Consider Input: [[98, -62, 67, -26], [-146, -173, 50, 98, 33, 48, -14], [-75, -51], [-46, 7], [-12, -78, 100, 6, -63], [-187, -178, -169, -154], [47, -156, -68, 17, -114, -94]]


Output: [98, 98, -51, 7, 100, -154, 47]