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: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]

Output: [-7, 91, 93, 86, 39, -35, 74, 72, 17]


Input: Consider Input: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]

Output: [86, 23, 78, 68, -116, 72, 55, 53]


Input: Consider Input: [[-103, -165, 95, -7], [88, -24, -150, -172, 26, -142], [-16, 38, -128, -38, -18, 42, 35], [-9, 12]]


Output: [95, 88, 42, 12]