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: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

Output: [28, 70, 52, 63, -145, 11]


Input: Consider Input: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

Output: [79, 56, -1, 85, 89, 61, -62, 31]


Input: Consider Input: [[-189, 7], [-174, 97, -144, -35], [20, -62], [-162, -74, -138, -1, -192, -185, 94], [-162, -89, -121, 59], [-192, 22, -77, 10, -137, -66]]


Output: [7, 97, 20, 94, 59, 22]