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: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]

Output: [-16, 68, 80, -85, -15, 94, 69]


Input: Consider Input: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

Output: [95, 60, 31, -122, 66, 84, 17]


Input: Consider Input: [[85, 31, 37, -3, 11, -116], [-112, -100, -114, -15, 13], [-148, -40, 11, -31, 94, -95, -141], [-62, 4, 63, -145, 77, -102], [-94, 40, -145], [50, -39, -122, -116, 69, -14], [4, -150, -72, -57, -200, -170, -150], [81, -155, -200, -98, -69, 77, -20]]


Output: [85, 13, 94, 77, 40, 69, 4, 81]