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: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]

Output: [95, 58, 72, 99, 80, 89, -18, -25]


Input: Consider Input: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]

Output: [-17, -31, 56, 64]


Input: Consider Input: [[57, -166, -70, 19, -128, -183, -102], [17, -85, -160, -135, -135, -87], [-188, -170, 88, -149, -76, -55, 74], [41, -39, 21, -139, -141, 65, 95], [-97, -179, 25, 27, -138, -195], [-91, -200, -102, -138, -139, -169, 10], [-103, -71, -38, 89, -46, -65], [52, -14, -97], [-127, 95, 87]]


Output: [57, 17, 88, 95, 27, 10, 89, 52, 95]