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: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]

Output: [37, 75]


Input: Consider Input: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]

Output: [78, 53, 93, 86, -31]


Input: Consider Input: [[-117, 61, 68, -25], [90, 5, -125, -177, -188, -3], [-85, 19, -134, 67], [-168, -180, 93, 56], [20, -91, 98], [39, -4, -151], [-89, -150, -171, 51, -120], [-184, -12, 94, -64, 38]]


Output: [68, 90, 67, 93, 98, 39, 51, 94]