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: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Output: [38, 80, 94, 31]


Input: Consider Input: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]

Output: [83, 87, 54, -18, 51, -13]


Input: Consider Input: [[-109, 72, 40, -63, -47], [-85, 52, -90], [-130, -158, -57, -74, -173, 9, -69], [-170, -111, -196, 28, -172, 23, -40], [97, 57, 46, 98, -19], [-99, -125, -112, -59, -15]]


Output: [72, 52, 9, 28, 98, -15]