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: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]

Output: [-29, 69, 1, 54, 52]


Input: Consider Input: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]

Output: [52, 76, 70, 93, 26, 99, 12, 94]


Input: Consider Input: [[-67, -12], [51, -32, -128, -164], [70, 6, 80, -54, -72], [56, -167, 39, 36, -80], [-97, -164, -125, -74, 37]]


Output: [-12, 51, 80, 56, 37]