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: [[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: [[43, -24, -117, -161], [94, -197, -168, -6, -9, -41, -87], [-180, -127, -125, -92, -143], [88, 82, -168], [-112, -183], [90, 80, 7, -33, -88, -178, -162], [-151, -91, 64, -15, 47, -33], [-172, -71, 35, -144, -126, -109, 76], [-31, -46, -43, -39]]


Output: [43, 94, -92, 88, -112, 90, 64, 76, -31]