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: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]

Output: [62, 84, 96]


Input: Consider Input: [[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]


Output: [-42, 30, 87, 34]