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: [[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]

Output: [71, 70, 33]


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: [[-27, -59, 41, -123, -67, 21, -125], [26, -54, -105, 96, -116, 84], [24, -171, -52, -24, -104, 47]]


Output: [41, 96, 47]