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: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]

Output: [89, 96, -69, 40, 90, 75, 99, 98, 41]


Input: Consider Input: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]

Output: [-57, 95, 65, -1, 100, 55, 31, 94]


Input: Consider Input: [[-101, -64], [-17, -164], [-153, -106, 39, -133, 11, -25], [15, -158, -185], [-94, -139, -191, -5, 39, 83, -156], [35, 43], [-55, 66, -18, 55, -132], [-126, 77, -189, -52, -121], [-77, -99]]


Output: [-64, -17, 39, 15, 83, 43, 66, 77, -77]