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: [[-106, -87, -48, -151, -158], [37, -16, -44, -111, -9, 24], [77, -42, 54, -105, -26, 78, 55], [-60, -1, -86, 94, -187, -90], [-163, -119], [79, -109, -183, -28], [23, 3, 43], [49, -109, -5, -47, -196], [7, -35, 95, -85, 99, -86, -22]]

Output: [-48, 37, 78, 94, -119, 79, 43, 49, 99]


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: [[75, -186, -132, -166, -39, -196, -163], [-130, 89, -64], [-39, -86, -73, -159], [-109, -141, 90], [70, -133, -173], [9, -197, 62, -107]]


Output: [75, 89, -39, 90, 70, 62]