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: [[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]

Output: [66, 78, -6, 42, 66, 42]


Input: Consider Input: [[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]

Output: [83, 91, 46, 53, 29, 77, 52, -68, -33]


Input: Consider Input: [[-14, -32], [-86, 17, -65, -122, -78, -49], [-37, -106, -124, 28, -109], [-15, -124, 79, -133, 2, 5], [-50, -60, -125, 90, 20, -163], [-44, 18, 44], [76, -24, -101], [78, -65, 17, -93]]


Output: [-14, 17, 28, 79, 90, 44, 76, 78]