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: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]

Output: [-111, 83, -8, 92, 55, 91, 70]


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: [[-81, -170, -61, 23], [-64, -189], [-67, 89, 17, 66], [-126, -23, -171, -180, 48], [-167, -114], [28, -11, -77, -105], [7, 44, -37], [-53, -178]]


Output: [23, -64, 89, 48, -114, 28, 44, -53]