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: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

Output: [94, -107, 43]


Input: Consider Input: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

Output: [95, 57, -144, 66, 54, 52, 93, 100, 21]


Input: Consider Input: [[-102, 89, -184, 67], [-4, -189, -157, -162], [-170, -83, -112], [1, 97, -110, -163, 2], [-55, -131, -166, 35], [-182, 86, -6, -31, 27, -125, -156], [45, -71, 4, 32, -140], [-149, -132, 60]]


Output: [89, -4, -83, 97, 35, 86, 45, 60]