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: [[-4, -117, -177, -28, -87, -48], [-168, -118, 18, 12, -108, 83, -91]]

Output: [-4, 83]


Input: Consider Input: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

Output: [92, 46, 25, 19]


Input: Consider Input: [[53, -53, -174, -72, 21, 58, 47], [18, -142, -194, -67, 86, -71, -157], [-85, -36], [-28, 86, 2, 64, 53, -186, -135], [-108, -9, -117, -48], [85, -196, -127], [-181, 27, 51], [26, -172, -26, -197, -41, 56], [-94, 21, -136]]


Output: [58, 86, -36, 86, -9, 85, 51, 56, 21]