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: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

Output: [10, -59, 99, 48, 18, 80]


Input: Consider Input: [[92, -175], [-99, -116]]

Output: [92, -99]


Input: Consider Input: [[-187, -171, -46, 44], [42, 65, -132, 92, -12, 72, -185], [-167, -50, -118, -4, 86, -109, -122], [-158, -186, -134, 86, 57, -101], [-36, -120, -177, 35], [-172, -158, -32], [-147, 5], [10, -182]]


Output: [44, 92, 86, 86, 35, -32, 5, 10]