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: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

Output: [58, 19, 68]


Input: Consider Input: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

Output: [70, -48, -19]


Input: Consider Input: [[-77, -110, -128, -47, 18, 42, 13], [53, 20, -195, 28, -54], [-95, -151, -1], [80, -130], [-137, -158, 60, -147, 15], [-194, -27, -106, -104, -162], [-103, 0, -157, 63]]


Output: [42, 53, -1, 80, 60, -27, 63]