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: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]

Output: [47, 27, 93, 67, 100, 70, 11, -5, -17]


Input: Consider Input: [[-42, -57, 13, -41], [45, -68, -199]]

Output: [13, 45]


Input: Consider Input: [[-142, 97, -56, -146, -109, 84, -140], [17, -139, -73, 93, -50, 57, 27], [-55, -114, 57], [-3, -86, -41, 84, -196, -25], [98, 97, -182, -27, 98, -167, -33], [-191, 2, -64]]


Output: [97, 93, 57, 84, 98, 2]