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: [[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]

Output: [72, 77, 74, 24, -168, -8, 64, 59, 45]


Input: Consider Input: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

Output: [99, 54, 32]


Input: Consider Input: [[57, -162, -155, -67], [-127, -161, -75], [-5, -91, -149], [-184, -83, -93, -30], [-31, 56, -16, -51, -80]]


Output: [57, -75, -5, -30, 56]