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: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

Output: [-63, 82, 79]


Input: Consider Input: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]

Output: [56, -87, 97, 5, 75, 100, 39, 38]


Input: Consider Input: [[-142, 91, -195, 23], [26, -31, -121, -199, 66], [-31, 67, -52, -99, 91, -34], [13, -125, -106, 1, 26, -91], [-122, -132, -183, 28, -90, 83, 29]]


Output: [91, 66, 91, 26, 83]