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: [[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]

Output: [24, 48, 2, 1, 18]


Input: Consider Input: [[-36, -152, -104, -52, 52, 6], [90, -19, -71, -183, -183, -15, -153]]

Output: [52, 90]


Input: Consider Input: [[-137, -117, -1, 42, -157], [-170, -105, 37, 62, -31, -118, 49], [-146, 19], [-144, -83], [-63, -159, -14, -135, -56], [-163, -145, -154, -174, -184, -7]]


Output: [42, 62, 19, -83, -14, -7]