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.

Example Input: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]
Example Output: [9, -5, 62, -35, 92, -30, 91]

Example Input: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]
Example Output: [97, 24, -43, 79, 51, 72]

Example Input: [[14, -139, -112, -76, -153, -132], [-140, -4, -167, -112, -78, -190], [-192, 6, -177, -36, -62, -14, -189], [-129, -18, -53, -91, -174], [40, -132, -30, 96, 75, 25, 99]]
Example Output:
[14, -4, 6, -18, 99]