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: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

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


Input: Consider Input: [[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]

Output: [78, 80, 91, 99]


Input: Consider Input: [[86, 26, 57, 44, -195, -94], [-192, 68, -132, -127, 31, 94], [-118, 86, -79, -160, -52, 4, -14], [-126, -128, -189, -130, -24], [-30, -126, -193], [-174, -162, -49, -61, -134, -194], [63, -54], [82, -64, 36]]


Output: [86, 94, 86, -24, -30, -49, 63, 82]