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: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]

Output: [17, 85, 20, 70, 12, 73, 90, 59, 58]


Input: Consider Input: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]

Output: [79, 0, -71, 32, 98, 26, 20, 70]


Input: Consider Input: [[29, -86, 53], [-83, -96, 35, -92, 84], [84, -128], [-7, -107, -36, -113, -195], [-99, 96, -23], [-195, -86]]


Output: [53, 84, 84, -7, 96, -86]