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: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]

Output: [52, 8, 23, 54, -147, 61, 25, -44, 92]


Input: Consider Input: [[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]

Output: [97, 23, -2, 61, 62, 68, 12, 15]


Input: Consider Input: [[78, -98, 29, -117], [-174, 22, -157, -12], [-137, -12, -194, -83, 48, -161], [61, -198], [100, -153, 75, -18]]


Output: [78, 22, 48, 61, 100]