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: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]

Output: [96, 2, 19, 59, 43, 38, -46]


Input: Consider Input: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]

Output: [81, 84, -3, 93, -41, 21, 6, 87, -16]


Input: Consider Input: [[-82, -78, 10, -160, -59, 19, 73], [-4, 21, -43, -6, -36, 97, 18], [22, 47, -2], [16, 23, -172, -114, -193], [27, -146, -5, 77, 95, -35], [97, -186, -193, 50, -150, 24, -115], [97, 44, -106, -99, -101], [-66, 66, -39, 95, -38, 2, 66], [-49, -37, -163, -195, 52, -52]]


Output: [73, 97, 47, 23, 95, 97, 97, 95, 52]