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: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]

Output: [-135, 19, -152, -91, 22, -152]


Input: Consider Input: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

Output: [75, 34, 96, 33, 21, 50, 17]


Input: Consider Input: [[-74, -25], [-13, -112], [6, -59, -179, 37, -168, -20, -4]]


Output: [-25, -13, 37]