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: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

Output: [70, -48, -19]


Input: Consider Input: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]

Output: [79, -33, 2, 42, 81, -142, 71]


Input: Consider Input: [[-121, -111, 99], [57, 45, -151, 84], [-2, -175, 58, -22], [-50, -17, -90, 40], [-159, 96], [-119, 83, -109, 17, -85, -185, -190], [-64, 61, 11, -81, -134, 45], [66, -63, 91, -148, -94]]


Output: [99, 84, 58, 40, 96, 83, 61, 91]