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: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

Output: [67, 90]


Input: Consider Input: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

Output: [48, -87, 96, 54, 91, 58, -23]


Input: Consider Input: [[-58, -88, -1, -192], [-196, -138, -34, 7, -135, 16, 95], [-189, 33, 31, -193], [-44, -89], [55, -2, -200, -142, -50, -89, -148], [44, -28, -179, -87, -178, -108], [92, -85, -127, -73, -151]]


Output: [-1, 95, 33, -44, 55, 44, 92]